Vidyalelo
Data Structure · Q84

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 84

Q84

Which is the correct technique for finding a maximum matching in a graph?

A.
BFS traversal
Answer
B.
DFS traversal
C.
Shortest path traversal
D.
Heap order traversal

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board