The code uses matrix tree theorem. Basically, we compute adjacency matrix and then form Laplacian matrix. We then compute any cofactor of said Laplacian matrix. The result is the number of spanning trees.
-
Notifications
You must be signed in to change notification settings - Fork 0
ddsuhaimi/spanning_grid_counter
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A script to count spanning trees in an m by n grid graph
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published