984-ISHU / PathFinder Public

Notifications You must be signed in to change notification settings
Fork 1
Star 1

Program to find the shortest distance between any two major stations (using Dijkstra's algorithm) of the South Western Railway Network (India).

1 star 1 fork Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 7 Commits
PathFinder.c		PathFinder.c
README.md		README.md
south-western-railway-zone.jpg		south-western-railway-zone.jpg

Repository files navigation

PathFinder

Program to find the shortest distance between any two major stations of the South Western Railway Network (India).

Data Structure Used: Weighted Graphs using Adjacency Matrix

Algorithm Used: Dijkstra's Algorithm

Map:

About

Program to find the shortest distance between any two major stations (using Dijkstra's algorithm) of the South Western Railway Network (India).

graphs shortest-path-algorithm graphs-algorithms djikstra-algorithm railway-operation-simulator

Report repository

Releases

No releases published

Packages

No packages published

Languages

C 100.0%