Issues

• Split blossom implementation into understandable independent pieces

  graph-algorithm/maximum-matching#5 · Filter by author make-github-pseudonymous-again opened on Sep 24, 2020

• Implement more efficient maximum cardinality matching algorithms

  graph-algorithm/maximum-matching#4 · Filter by author make-github-pseudonymous-again opened on Sep 24, 2020

• Implement more efficient bipartite maximum matching algorithms

  graph-algorithm/maximum-matching#3 · Filter by author make-github-pseudonymous-again opened on Sep 24, 2020

• Implement linear-time approximation algorithm by Duan and Pettie

  graph-algorithm/maximum-matching#2 · Filter by author make-github-pseudonymous-again opened on Sep 24, 2020

• Implement O(n^4) algorithm

  graph-algorithm/maximum-matching#1 · Filter by author make-github-pseudonymous-again opened on Sep 24, 2020