In the given graph, how many intermediate vertices are required to travel from node a to node e at a minimum cost?

Which algorithm is used to find the shortest path from a source node to all other nodes in a graph with non-negative weights?

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(V²)

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