Dijkstra's algorithm (or Dijkstra's Shortest Path First algorithm, SPF algorithm) is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later. For better understading of the algorithm, check out the wikipedia page.
This application is still UNDER DEVELOPMENT!!
- A Toolbar with the following tools:
- Move Tool (Selecting / Moving nodes)
- Add Tool (Adding nodes)
- Connect Tool (Connecting nodes)
- Delete Tool (Deleting nodes therefore it's connections)
- The ability to customize nodes (text / color / its connections weights)
- Highlight the shortest path between two chosen nodes
This application uses a number of open source projects to work properly:
And of course this application itself is open source with a public repository on GitHub.
This application requires Python to be installed in your computer.
Install the necessary modules using pip.
$ cd dijkstra-gui
$ pip install -r requirements.txt
$ python main.py
- Serialization / Deserialization of created graphs
- Implementation of directed graphs
- Improve GUI
MIT
Free Software, Hell Yeah!