I want to get the maximum matching of a graph.
Now, I use the algorithm in Networkx: nx.algorithms.bipartite.matching.hopcroft_karp_matching(G)
However, I didn't find a similar algorithm in SNAPenter link description here.
And for NetworKit, I found this page:enter link description here. But I don't know how to use it.
Any ideas? How to use NetworKit/SNAP to get the maximum matching of a graph?