There is relationship between number of back edges and number of cycles in DFS Select correct option: Both are equal. Cycles are half of back edges. Cycles are one fourth of back edges. There is no relationship between back edges and number of cycles . (Correct) In strong components algorithm, the form of graph is used in which all the vertices of original graph G have been reversed in direction. Select correct option: True (Correct) False In Kruskal's algorithm, the next edge is added to viable set A, if its adding does not induce a/an __________ . Select correct option: Vertex Edge Cycle (Correct) Tree For undirected graph, there is no distinction between forward and back edges. Select correct option: True (Correct) False You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T ? Select correct option: (V+E) (Corre
Comments
Post a Comment
Please give us your feedback & help us to improve this site.