Solved

A Person Wants to Visit Some Places

Question 25

Multiple Choice

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) bfs
B) dfs
C) prim\s
D) kruskal\s

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Q15: The kernel code is dentified by the _qualifier

Q16: The space required to store the adjacency

Q17: In Dijkstra's all pair shortest path each

Q18: identify Load-Balancing Scheme/s<br>A)asynchronous round robin<br>B)global round robin<br>C)random

Q19: Odd-even transposition sort is a variation of<br>A)quick

Q20: Graph can be represented by<br>A)identity matrix<br>B)adjacency matrix<br>C)sprse

Q21: What is the average running time of

Q22: Given an array of n elements and

Q23: In parallel Quick Sort Pivot is sent

Q24: A* algorithm is a<br>A)bfs algorithm<br>B)dfs algorithm<br>C)prim\s algorithm<br>D)kruskal\s