Skip to content

AarSeBail/tree-hugger

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

16 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

tree-hugger

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

About

A binary for computing spanning tree maximizers

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages