Question 2 (10 marks)
One question on graph algorithms (using say DFS and/or BFS), for example,
- hasPath(G,src,dest), goto the slide
- findPath(G,src,dest), goto the slide
- findPathBFS(G,src,dest), goto the slide
- dfsCycleCheck(G,v), goto the slide
- components(G), goto the slide
- countReachableNodes(G, v), count number of nodes reachable from node "v" in a directed graph "g".