A rust binary for computing M edge graphs which obtain the largest number of spanning trees possible for an M edge graph.
Currently Implemented
- Command line arguments
- Kirchhoff's Theorem
Possible Future Work
- Tricks using eigenvalue stability
- Possible reduction via edge contraction