Question: algorithms 17. [10pts] Construct a sample directed graph with 7 vertices and 11 edges. Run BFS on your graph, number the vertices with the BFS

17. [10pts] Construct a sample directed graph with 7 vertices and 11 edges. Run BFS on your graph, number the vertices with the BFS numbers and construct the BFS tree of your traversal. 19. [10pts] What is the running time of BFS if we represent its input graph by an adjacency matrix and modify the algorithm to handle this form of input? (Note that the algorithm we have seen in class assumes an adjancency-list representation.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
