Consider the graph M with 3 vertices. Its adjacency matrix is shown below. Which of the following is true?
\[{\text{M}} = \left[ {\begin{array}{*{20}{c}}
0&1&1 \\
1&0&1 \\
1&1&0
\end{array}} \right]\]
A. Graph M has no minimum spanning tree
B. Graph M has a unique minimum spanning trees of cost 2
C. Graph M has 3 distinct minimum spanning trees, each of cost 2
D. Graph M has 3 spanning trees of different costs
Answer: Option C
This Question Belongs to Data Structure >> Graph Algorithms (DFS, BFS, Dijkstras, Etc)
A. Breadth-First Search (BFS)
B. Depth-First Search (DFS)
C. Bellman-Ford Algorithm
D. Dijkstra's Algorithm
What is the time complexity of Breadth-First Search (BFS) on a graph with V vertices and E edges?
A. O(V + E)
B. O(V2)
C. O(E log V)
D. O(V log V)
In Depth-First Search (DFS), what is the order of visiting nodes?
A. Level order
B. Inorder
C. Postorder
D. Preorder
Which algorithm can be used to detect negative weight cycles in a graph?
A. Dijkstra's Algorithm
B. Prim's Algorithm
C. Bellman-Ford Algorithm
D. Kruskal's Algorithm
Join The Discussion