Graph Traversal I Starter Quiz

What is the best data structure to implement topological sort on directed graph?

Top to down traversing of tree is called?

A person wants to visit some places. He starts from a vertex and then wants to visit every place connected to this vertex and so on. What algorithm he should use?

In the _____ traversal we process all of a vertex's descendants before we move to an adjacent vertex.

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 ?

Which of the following statement is true?

Which of the following graphs Topological ordering is not possible?