search

dkondor / maxmatch_MV

Micali Vazirani Maximum Cardinality Matching Algorithm for symmetric (undirected) graphs
7 stars 2 forks source link

What is the input format? #2

Open karlosss opened 1 month ago

karlosss commented 1 month ago

Hi,

the readme mentions

running:

./mmmv < graph_edges.dat > maxmatch_edges.dat

but graph_edges.dat is not present in the repository. What is the expected input format?

Thanks in advance, great work by the way!

dkondor commented 4 weeks ago

Hi, input should ba an edgelist as a TSV file: Each line should contain one edge, by giving the IDs of the two nodes that are its endpoint, separated by spaces or tab. IDs are unsigned 32-bit integers (i.e. range between 0 and 2^32-1). Let me know if this makes sense or if you have any issues running the code.