A short program in the Algorithms and Complexity class, where you can generate a graph with a specific number of nodes and get a perfect matching graph if it exists.
-
Updated
Aug 14, 2018 - Java
A short program in the Algorithms and Complexity class, where you can generate a graph with a specific number of nodes and get a perfect matching graph if it exists.
gMark is a domain- and query language-independent graph instance and query workload generator.
Add a description, image, and links to the graph-generator topic page so that developers can more easily learn about it.
To associate your repository with the graph-generator topic, visit your repo's landing page and select "manage topics."