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: about 1 month 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 (almost 7 years ago)
• Default Branch: main
• Last Pushed: 2021-01-27T21:11:45.000Z (about 4 years ago)
• Last Synced: 2024-11-12T09:49:18.598Z (3 months ago)
• Topics: algorithm, graph, graphs, spanning-trees
• Language: Java
• Homepage:
• Size: 9.77 KB
• Stars: 2
• Watchers: 1
• Forks: 0
• Open Issues: 7
• Metadata Files:
  • Readme: README.md
  • License: LICENSE.md/LICENSE.md

Awesome Lists containing this project

README

        
# Kirchhoffs-Theorem

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.