This is a small data structure prohect I made for the subject. The problem statement is to find appropriate route from source railway station to destination railway station in Mumbai. I have used Dijkstra's algorithm for shortest path to find route and printed paths using recursion.
-
Notifications
You must be signed in to change notification settings - Fork 0
10aditya/Local-router
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
C program to determine path between two railway stations of Mumbai Local.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published