What is the formula to compute the transitive closure of a graph?
A. tij(k) = tij(k-1) AND (tik(k-1) OR tkj(k-1))
B. tij(k) = tij(k-1) OR (tik(k-1) AND tkj(k-1))
C. tij(k) = tij(k-1) AND (tik(k-1) AND tkj(k-1))
D. tij(k) = tij(k-1) OR (tik(k-1) OR tkj(k-1))
Answer: Option B
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