{"id":40720558,"url":"https://github.com/orxfun/orx-bench-shortest-path","last_synced_at":"2026-01-21T13:36:39.071Z","repository":{"id":199980024,"uuid":"700751843","full_name":"orxfun/orx-bench-shortest-path","owner":"orxfun","description":"Benchmarks for single source single sink shortest path implementations","archived":false,"fork":false,"pushed_at":"2023-12-27T13:34:57.000Z","size":546,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2023-12-27T14:38:15.020Z","etag":null,"topics":["benchmark","data-structures","dijkstra-algorithm","priority-queue","rust","shortest-path-algorithm"],"latest_commit_sha":null,"homepage":"","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/orxfun.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":".github/FUNDING.yml","license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null},"funding":{"github":["orxfun"]}},"created_at":"2023-10-05T08:17:47.000Z","updated_at":"2023-12-22T04:44:07.000Z","dependencies_parsed_at":null,"dependency_job_id":"26ccb078-3df3-4739-ac0c-f75fe244f75f","html_url":"https://github.com/orxfun/orx-bench-shortest-path","commit_stats":null,"previous_names":["orxfun/orx-bench-shortest-path"],"tags_count":0,"template":null,"template_full_name":null,"purl":"pkg:github/orxfun/orx-bench-shortest-path","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/orxfun%2Forx-bench-shortest-path","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/orxfun%2Forx-bench-shortest-path/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/orxfun%2Forx-bench-shortest-path/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/orxfun%2Forx-bench-shortest-path/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/orxfun","download_url":"https://codeload.github.com/orxfun/orx-bench-shortest-path/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/orxfun%2Forx-bench-shortest-path/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28633774,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-21T04:47:28.174Z","status":"ssl_error","status_checked_at":"2026-01-21T04:47:22.943Z","response_time":86,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["benchmark","data-structures","dijkstra-algorithm","priority-queue","rust","shortest-path-algorithm"],"created_at":"2026-01-21T13:36:38.307Z","updated_at":"2026-01-21T13:36:39.066Z","avatar_url":"https://github.com/orxfun.png","language":"Rust","funding_links":["https://github.com/sponsors/orxfun"],"categories":[],"sub_categories":[],"readme":"# orx-bench-shortest-path\n\nA command line tool to enable benchmarking shortest path algorithms on different data sets with different graph representations, etc. It is possible to:\n\n* create full factorial experiments using `interactive` mode,\n* experiments can be executed directly from the interactive mode or from the created experiment file using `fromfile` mode.\n\n## Contribution\n\nIf you wish to add a different\n* graph representation,\n* queue type, or\n* algorithm implementation\n\nto the experimentation tool, please open an [issue](https://github.com/orxfun/orx-bench-shortest-path/issues/new) or create a PR.\n\n\n## A. Usage\n\n```bash\ncargo run help\n```\n\n![cli](docs/cli.png)\n\n## B. Analysis\n\nYou may find the results of the most recent experiments [here](docs/results-20231031.xlsx) and the summary below.\n\n### B.1. Algorithms\n\nCurrently, only Dijkstra's algorithm is experimented; however, with using different queues.\n\nIn the figure below, you may see the overall average of execution time with different variants.\n\n![algorithms-time](docs/algorithms-time.png)\n\nIn the next figure, required heap sizes are compared:\n\n![algorithms-memory-capacity](docs/algorithms-memory-capacity.png)\n\n\n### B.2. Graph Representation\n\nIn the figure below, you may see the overall average of execution time with different underlying graph structures.\n\n![graph-rep-time](docs/graph-rep-time.png)\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Forxfun%2Forx-bench-shortest-path","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Forxfun%2Forx-bench-shortest-path","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Forxfun%2Forx-bench-shortest-path/lists"}