A plugin for the utility program geng provided with Nauty that enables quick generation of nonisomorphic sparse and tight graphs.
-
Updated
May 1, 2024 - C
A plugin for the utility program geng provided with Nauty that enables quick generation of nonisomorphic sparse and tight graphs.
Finding shortest path from source node to all nodes using dijkstra's in linearithmic time
Add a description, image, and links to the sparse-graphs topic page so that developers can more easily learn about it.
To associate your repository with the sparse-graphs topic, visit your repo's landing page and select "manage topics."