Page 1 of 1
Q7 (5 points) Using words or pseudocode, describe an algorithm that, for a unweighted, undirected graph G, determines wh
Posted: Sat Nov 27, 2021 2:21 pm
by answerhappygod
- Q7 5 Points Using Words Or Pseudocode Describe An Algorithm That For A Unweighted Undirected Graph G Determines Wh 1 (61 KiB) Viewed 58 times
Q7 (5 points) Using words or pseudocode, describe an algorithm that, for a unweighted, undirected graph G, determines whether or not the graph is connected. Use DFS(G,V) as a subroutine (that is you don't have to give the pseudocode of the DFS traversal, you can simply call it from your pseudocode.) Make sure that your description is not ambiguous.