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