Which is the correct technique for finding a maximum matching in a graph?
(a) DFS traversal
(b) BFS traversal
(c) Shortest path traversal
(d) Heap order traversal
The question was posed to me in homework.
My question is from Matching in division Matching of Data Structures & Algorithms II