This code finds the number of distinct spanning trees of a graph where vertices are distinct given its adjacency matrix. There are no safeguards in this code. Invalid inputs will output nonsense. Finding the number of spanning trees of a graph takes O(n^3) time. There are more details in the files themselves.
-
Notifications
You must be signed in to change notification settings - Fork 0
DevonFulcher/Kirchhoffs-Theorem
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
An algorithm that returns the number of distinct spanning trees in a graph where nodes are distinguishable in O(n^3)
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published