{"id":34718796,"url":"https://github.com/mboecker/floyd-warshall","last_synced_at":"2026-05-28T14:31:00.151Z","repository":{"id":57630705,"uuid":"108326985","full_name":"mboecker/floyd-warshall","owner":"mboecker","description":null,"archived":false,"fork":false,"pushed_at":"2017-11-02T19:28:44.000Z","size":21,"stargazers_count":1,"open_issues_count":1,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2026-05-20T11:51:06.419Z","etag":null,"topics":["apsp","floyd-warshall","pathfinding-algorithm","rust","rust-library"],"latest_commit_sha":null,"homepage":null,"language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/mboecker.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2017-10-25T21:15:53.000Z","updated_at":"2019-04-11T15:23:18.000Z","dependencies_parsed_at":"2022-09-08T00:01:40.025Z","dependency_job_id":null,"html_url":"https://github.com/mboecker/floyd-warshall","commit_stats":null,"previous_names":["zombiemuffin/floyd-warshall"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/mboecker/floyd-warshall","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mboecker%2Ffloyd-warshall","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mboecker%2Ffloyd-warshall/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mboecker%2Ffloyd-warshall/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mboecker%2Ffloyd-warshall/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mboecker","download_url":"https://codeload.github.com/mboecker/floyd-warshall/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mboecker%2Ffloyd-warshall/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33613431,"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-05-28T02:00:06.440Z","response_time":99,"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":["apsp","floyd-warshall","pathfinding-algorithm","rust","rust-library"],"created_at":"2025-12-25T01:28:31.653Z","updated_at":"2026-05-28T14:31:00.145Z","avatar_url":"https://github.com/mboecker.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# floyd-warshall\n\nThis is a rust crate which aims to solve the all-pairs-shortest-paths (APSP) problem efficiently. It uses [petgraph](https://crates.io/crates/petgraph) for graph storage and the Floyd-Warshall algorithm to solve the given problem in **O(V^(3))** runtime.\n\nFor examples, please have a look at the test cases. It consists of two simple tests (one fully connected graph and one graph, where it's shorter to use an intermediate node) and a random graph test, to manually verify the shortest paths for larger, random graphs.\n\nThe ultimate goal is to use the algorithm by [Thorup (1999)](https://dl.acm.org/citation.cfm?id=316548) to solve the same problem in **O(VE)** runtime.\n\nContributions are welcome!\n\n## TODO-List\n\n- Use mocking\n- More unit tests\n- cleaner API\n- more efficient path saving\n- include [algorithm by Thorup](https://dl.acm.org/citation.cfm?id=316548)\n\n# License\n\nThis work is licensed under terms of the MIT License. See LICENSE.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmboecker%2Ffloyd-warshall","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmboecker%2Ffloyd-warshall","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmboecker%2Ffloyd-warshall/lists"}