{"id":19729486,"url":"https://github.com/bb4/bb4-shortest-paths","last_synced_at":"2026-05-16T05:12:05.813Z","repository":{"id":220691765,"uuid":"752311933","full_name":"bb4/bb4-shortest-paths","owner":"bb4","description":"Implementation of some populate shortest path algorithms in graphs","archived":false,"fork":false,"pushed_at":"2024-08-03T14:07:41.000Z","size":7233,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-10T17:41:31.544Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Scala","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/bb4.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-02-03T15:55:05.000Z","updated_at":"2024-08-03T14:07:44.000Z","dependencies_parsed_at":"2024-03-31T12:33:20.113Z","dependency_job_id":"44e356c4-1197-44b3-a097-78d86b918ac9","html_url":"https://github.com/bb4/bb4-shortest-paths","commit_stats":null,"previous_names":["barrybecker4/bb4-shortest-paths"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bb4%2Fbb4-shortest-paths","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bb4%2Fbb4-shortest-paths/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bb4%2Fbb4-shortest-paths/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/bb4%2Fbb4-shortest-paths/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/bb4","download_url":"https://codeload.github.com/bb4/bb4-shortest-paths/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241052527,"owners_count":19901042,"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":[],"created_at":"2024-11-12T00:12:37.366Z","updated_at":"2026-05-16T05:12:05.731Z","avatar_url":"https://github.com/bb4.png","language":"Scala","funding_links":[],"categories":[],"sub_categories":[],"readme":"# bb4-shortest-paths\n\nSome shortest path algorithm implementations and visualizations.\n - Dijkstra's algorithm - single-source shortest paths \n - ModifiedDijkstra's - shortest path between two nodes\n - Yen's algorithm - finds the K shortest paths between two nodes\n\nA GraphViewerApp is also provided. It allows you to view the graph test cases.\n\n## How to use it\n\nRun ./gradlew to build and run the tests.\n\nThe default application is the GraphViewerApp. It allows you to view the graph tests cases and their results.\nFor example, here is a shortest path result for sp_120 example. For Dijkstras and ModifiedDijkstras, you can mouse over a node to see the shortest path to that node.\n\n![Mouse over to see shortest path to node](images/sp_120_dijkstra_solution.png)\n![Mouse over to see shortest path to node](images/network_dijkstra_solution.png)\u003c/br\u003e\u003c/br\u003e\nFor Yens and Eppsteins algorithm, you can mouse over nodes or edges to see the shortest paths that pass through that respective node or edge. There is a different color for each of the k-shortest paths found.\n![Mouse over to see shortest path to node out of k-paths](images/sp_100_1_yens-k-shortest-paths.png)\n\nFuture Features\n - add other variations of Eppsteins algorithm.\n\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbb4%2Fbb4-shortest-paths","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbb4%2Fbb4-shortest-paths","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbb4%2Fbb4-shortest-paths/lists"}