{"id":19812710,"url":"https://github.com/devonfulcher/kirchhoffs-theorem","last_synced_at":"2026-06-10T08:31:18.176Z","repository":{"id":95923323,"uuid":"131457604","full_name":"DevonFulcher/Kirchhoffs-Theorem","owner":"DevonFulcher","description":"An algorithm that returns the number of distinct spanning trees in a graph where nodes are distinguishable in O(n^3)","archived":false,"fork":false,"pushed_at":"2021-01-27T21:11:45.000Z","size":10,"stargazers_count":2,"open_issues_count":7,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-11-23T08:14:18.898Z","etag":null,"topics":["algorithm","graph","graphs","spanning-trees"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/DevonFulcher.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.md/LICENSE.md","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2018-04-29T01:43:06.000Z","updated_at":"2023-02-06T18:28:43.000Z","dependencies_parsed_at":null,"dependency_job_id":"1449782b-a836-4a12-b5bc-69717dbd3f00","html_url":"https://github.com/DevonFulcher/Kirchhoffs-Theorem","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/DevonFulcher/Kirchhoffs-Theorem","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DevonFulcher%2FKirchhoffs-Theorem","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DevonFulcher%2FKirchhoffs-Theorem/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DevonFulcher%2FKirchhoffs-Theorem/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DevonFulcher%2FKirchhoffs-Theorem/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/DevonFulcher","download_url":"https://codeload.github.com/DevonFulcher/Kirchhoffs-Theorem/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/DevonFulcher%2FKirchhoffs-Theorem/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34144679,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-10T02:00:07.152Z","response_time":89,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithm","graph","graphs","spanning-trees"],"created_at":"2024-11-12T09:32:05.354Z","updated_at":"2026-06-10T08:31:18.130Z","avatar_url":"https://github.com/DevonFulcher.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Kirchhoffs-Theorem\n\nThis 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.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdevonfulcher%2Fkirchhoffs-theorem","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdevonfulcher%2Fkirchhoffs-theorem","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdevonfulcher%2Fkirchhoffs-theorem/lists"}