Pseudocode[edit]Input: A graph G and a vertex v of G
Output: All vertices reachable from v labeled as discovered
A recursive implementation of
DFS:[5]1 procedure DFS(G,v):
2 label v as discovered
3 for all edges from v to w in G....
See more
590,000
625,000
6% off
1,499
2,499
40% off
590,000
625,000
6% off
3,999
5,499
27% off
999
1,499
33% off
590,000
0.0
5.0
Download the Study24x7 App, so you can connect and collaborate.
