A person wants to visit some places. He starts from a vertex and then wants to visit every vertex till it finishes from one vertex, backtracks and then explore other vertex from same vertex. What algorithm he should use?
A. Depth First Search
B. Breadth First Search
C. Trim's algorithm
D. Kruskal's Algorithm
Answer: Option A
This Question Belongs to Data Structure >> Graph Algorithms (DFS, BFS, Dijkstras, Etc)
Related Questions on Graph Algorithms (DFS, BFS, Dijkstras, etc)
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(V2)
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
Join The Discussion