This is a Data Structure Course project that used Graph algorithms (mainly Dijkstra ) to calculate the shortest path for a metro bus using the theoretical calculations techniques. It also includes a Management System for the execution and deployment with use Queues and Stacks.
-
Notifications
You must be signed in to change notification settings - Fork 0
This is a Data Structure Course project that used Graph algorithms (mainly Dijkstra ) to calculate the shortest path for a metro bus using the theoretical calculations techniques. It also includes a Management System for the execution and deployment with use Queues and Stacks.
Haseeb-Panhwar/Metro-System-using-Dijkstra-in-Cpp
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This is a Data Structure Course project that used Graph algorithms (mainly Dijkstra ) to calculate the shortest path for a metro bus using the theoretical calculations techniques. It also includes a Management System for the execution and deployment with use Queues and Stacks.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published