Make a set of all nodes that can occur in any path from a source to a destination in both directed as well as undirected graph. Note that a node can be visited any number of times not necessarily only once.

Question

Accepted Answer

The set of all nodes that can occur in any path from a source to a destination in both directed and undirected graphs.

Perform a depth-first search (DFS) or breadth-first search (BFS) from the source node to the destination node.
During the search, keep track of all visited nodes.
Add each visited node to the set of nodes that can occur in any path.
Repeat the search for both directed and undirected graphs.
The resulting set will contain all nodes that can occur in any path from the source to the destination.

Make a set of all nodes that can occur in any path from a source to a destination in both directed as well as undirected graph. Note that a node can be visited any number of times not necessarily only once.

Top Housing.com Software Engineer interview questions & answers

Popular interview questions of Software Engineer