GitHub / DevonFulcher / Kirchhoffs-Theorem

An algorithm that returns the number of distinct spanning trees in a graph where nodes are distinguishable in O(n^3)

JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DevonFulcher%2FKirchhoffs-Theorem
PURL: pkg:github/DevonFulcher/Kirchhoffs-Theorem

Stars: 2
Forks: 0
Open issues: 7

License: None
Language: Java
Size: 9.77 KB
Dependencies parsed at: Pending

Created at: over 7 years ago
Updated at: over 2 years ago
Pushed at: over 4 years ago
Last synced at: 6 months ago

Topics: algorithm, graph, graphs, spanning-trees

Loading...