GATE 2025 Algorithm Foundation Quiz 10

Consider the tree arcs of a BFS traversal from a source node W in an unweighted, connected, undirected graph. The tree T formed by the tree arcs is a data structure for computing ?

Apply BFS and DFS on the graph below and find how many nodes are at same position start from node A.

Which of the following statement is true for the Bellman-Ford algorithm?

Given a disconnected graph on 10 vertices, what is the max number of edges it can have ________.

Consider the following graph:

What is the depth first search (DFS) sequence for the above graph?