Saved Bookmarks
| 1. |
Transform a nd conquer technique for finding no of walks between two vertices |
|
Answer» Count the total number of ways or paths that EXIST between two vertices in a directed GRAPH. These paths doesn’t contain a cycle, the SIMPLE enough reason is that a cylce contain infinite number of paths and hence they create PROBLEM. |
|