31. Given pseudo code of Dijkstra's Algorithm.
//Initialise single source(G,s)
S=0
Q=V[G]
While Q != 0
Do u=extract-min(Q)
S=S union {u}
For each vertex v in adj[u]
Do relax(u,v,w)
What happens when "While Q != 0" is changed to "while Q>1"?
//Initialise single source(G,s)
S=0
Q=V[G]
While Q != 0
Do u=extract-min(Q)
S=S union {u}
For each vertex v in adj[u]
Do relax(u,v,w)32. Every graph has only one minimum spanning tree.
33. In Depth First Search, how many times a node is visited?
34. What happens when the value of k is 0 in the Floyd Warshall Algorithm?
35. Which of the following branch and bound strategy leads to depth first search?
36. What is running time of Dijkstra's algorithm using Binary min- heap method?
37. Which of the following data structure is used to implement BFS?
38. Dijkstra's Algorithm run on a weighted, directed graph G={V,E} with non-negative weight function w and source s, terminates with d[u]=delta(s,u) for all vertices u in V.
39. Kruskal's algorithm is best suited for the sparse graphs than the prim's algorithm.
40. In the given graph, identify the path that has minimum cost to travel from node a to node f.
/1725275801-201-13.png "Graph Algorithms (DFS, BFS, Dijkstras, etc) mcq question image")
Read More Section(Graph Algorithms (DFS, BFS, Dijkstras, etc))
Each Section contains maximum 100 MCQs question on Graph Algorithms (DFS, BFS, Dijkstras, etc). To get more questions visit other sections.