Skip to content

jaredbeck/spanning_trees

Repository files navigation

SpanningTrees

Algorithms for finding spanning trees in graphs.

License

Hippocratic License 2.1

By using this software you accept the terms of the license.

Usage

TBD

Contributing

This project does not accept bug reports or feature requests. Pull requests are welcome. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the code of conduct.

References

  • Tarjan, R. E. (1976) Edge-Disjoint Spanning Trees and Depth-First Search. Acta Informatica, v.6, p.171-185

About

Algorithms for finding spanning trees in graphs.

Resources

License

Code of conduct

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors