Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/devonfulcher/kirchhoffs-theorem
An algorithm that returns the number of distinct spanning trees in a graph where nodes are distinguishable in O(n^3)
https://github.com/devonfulcher/kirchhoffs-theorem
algorithm graph graphs spanning-trees
Last synced: 4 days ago
JSON representation
An algorithm that returns the number of distinct spanning trees in a graph where nodes are distinguishable in O(n^3)
- Host: GitHub
- URL: https://github.com/devonfulcher/kirchhoffs-theorem
- Owner: DevonFulcher
- Created: 2018-04-29T01:43:06.000Z (over 6 years ago)
- Default Branch: main
- Last Pushed: 2021-01-27T21:11:45.000Z (almost 4 years ago)
- Last Synced: 2023-03-06T06:54:58.328Z (over 1 year ago)
- Topics: algorithm, graph, graphs, spanning-trees
- Language: Java
- Homepage:
- Size: 9.77 KB
- Stars: 2
- Watchers: 0
- Forks: 0
- Open Issues: 7