This code defines a Python application that provides a graphical user interface (GUI) to interact with various graph algorithms for shortest-path calculations. The application is built using tkinter, networkx, and PIL libraries, allowing users to visualize a graph (specifically, a subway or transportation network) and run algorithms like Dijkstra’s, A*, Floyd-Warshall, Yen's K Shortest Paths, and Bellman-Ford to compute optimal routes between selected nodes.
-
Notifications
You must be signed in to change notification settings - Fork 0
kevhxx/Optimal-Route-Finding-Model
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Using Python with GUI to interact with various graph algorithms for shortest-path calculations.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published