I've started working on a [notebook](https://github.com/padath314/NetworkX-contribution/blob/main/GraphMatching.ipynb) about the Graph Matching algorithm and have been using the following Wikipedia pages as references: [Matching](https://en.wikipedia.org/wiki/Matching_(graph_theory)) [Blossom Algorithm](https://en.wikipedia.org/wiki/Blossom_algorithm) It is still very much in progress. Am I going in the right direction ?