{"id":18444937,"url":"https://github.com/filipporanza/all_shortest_path","last_synced_at":"2025-07-03T23:38:26.535Z","repository":{"id":57484817,"uuid":"438563665","full_name":"FilippoRanza/all_shortest_path","owner":"FilippoRanza","description":"Floyd-Warshall Algorithm implementation","archived":false,"fork":false,"pushed_at":"2021-12-15T15:10:58.000Z","size":6,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-04-14T22:56:28.314Z","etag":null,"topics":["all-shortest-path","floyd-warshall-algorithm","graph","minimal-spanning-tree"],"latest_commit_sha":null,"homepage":"https://crates.io/crates/all_shortest_path","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/FilippoRanza.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":"2021-12-15T09:07:07.000Z","updated_at":"2021-12-15T15:12:35.000Z","dependencies_parsed_at":"2022-08-26T11:10:35.683Z","dependency_job_id":null,"html_url":"https://github.com/FilippoRanza/all_shortest_path","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FilippoRanza%2Fall_shortest_path","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FilippoRanza%2Fall_shortest_path/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FilippoRanza%2Fall_shortest_path/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/FilippoRanza%2Fall_shortest_path/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/FilippoRanza","download_url":"https://codeload.github.com/FilippoRanza/all_shortest_path/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248975330,"owners_count":21192208,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":["all-shortest-path","floyd-warshall-algorithm","graph","minimal-spanning-tree"],"created_at":"2024-11-06T07:04:20.104Z","updated_at":"2025-04-14T22:56:31.493Z","avatar_url":"https://github.com/FilippoRanza.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"# all_shortest_path\n![example workflow](https://github.com/FilippoRanza/all_shortest_path/actions/workflows/rust.yml/badge.svg)\n![crates.io](https://img.shields.io/crates/v/all_shortest_path.svg)\n[![License: MIT](https://img.shields.io/badge/License-MIT-blue.svg)](https://opensource.org/licenses/MIT)\n\nFloyd-Warshall Algorithm implementation\n\n## Description \n`all_shortest_path` provides a simple [Floyd-Warshall](https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm) implementation. ","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffilipporanza%2Fall_shortest_path","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffilipporanza%2Fall_shortest_path","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffilipporanza%2Fall_shortest_path/lists"}