Question: A man wants to go different places in the world. He has listed them down all. But there are some places where he wants to visit before some other places. What application of graph can he use to determine that?
Options
A : Depth First Search
B : Breadth First Search
C : Topological Sorting
D : Dijkstra’s Shortest path algorithm
Data Structure Topological Sorting more questions
What is the formula for the depth and height of....
The full form of DBE is _________
A person wants to visit some places. He starts from....
A person wants to visit some places. He starts from....
Which of the following graph traversals closely imitates level order....
What is the formula for the depth of armature core?
The only drawback of lightweight concrete is that the ___________
The formula d=a×?(3q)/m is used to calculate _________
What is the formula for depth of winding of the....
What is the formula for the depth of the yoke?
Data Structure Adjacency List more Online Exam Quiz
Data Structure Stack Operations
Data Structure Stack Using Queues
Data Structure String Reversal Recursion
Data Structure Threaded Binary Tree
Data Structure Undirected Graph
Data Structure Uniform Binary Search