https://github.com/bb4/bb4-shortest-paths

Implementation of some populate shortest path algorithms in graphs
https://github.com/bb4/bb4-shortest-paths

Last synced: 12 months ago
JSON representation

Implementation of some populate shortest path algorithms in graphs

• Host: GitHub
• URL: https://github.com/bb4/bb4-shortest-paths
• Owner: bb4
• License: mit
• Created: 2024-02-03T15:55:05.000Z (about 2 years ago)
• Default Branch: master
• Last Pushed: 2024-08-03T14:07:41.000Z (over 1 year ago)
• Last Synced: 2025-01-10T17:41:31.544Z (about 1 year ago)
• Language: Scala
• Size: 6.9 MB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# bb4-shortest-paths

Some shortest path algorithm implementations and visualizations.

 - Dijkstra's algorithm - single-source shortest paths 

 - ModifiedDijkstra's - shortest path between two nodes

 - Yen's algorithm - finds the K shortest paths between two nodes

A GraphViewerApp is also provided. It allows you to view the graph test cases.

## How to use it

Run ./gradlew to build and run the tests.

The default application is the GraphViewerApp. It allows you to view the graph tests cases and their results.

For 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.

![Mouse over to see shortest path to node](images/sp_120_dijkstra_solution.png)

![Mouse over to see shortest path to node](images/network_dijkstra_solution.png)

For 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.

![Mouse over to see shortest path to node out of k-paths](images/sp_100_1_yens-k-shortest-paths.png)

Future Features

 - add other variations of Eppsteins algorithm.