This Project uses Dijkstra Algorithm to determine the shortest path from any Metro Station as source to all the possible Metro Stations.. The project is developed completely in java and has usecase in real time scenario. On selecting the source amongst any of metro stations it derives the shortest path to all the other metro stations. Each metro station is valued from numbers between 0 to 55.
COMPLEXITY: The time complexity of Dijkstras algorithm is O(N), N is the number of vertices in the graph. The space complexity of Dijkstras algorithm is O(N)+O(N).
Please follow the link for the same project developed in C++ https://github.com/Mak-3/Dijkstras-algorithm-HYDmetro
Node number Station Name
0 LBnagar
1 Victoria_memorial
2 Chaitanyapuri
3 Dilshukhnagar
4 Moosrambagh
5 New Market
6 Malakpet
7 MG BusStation
8 Osmania_medical
9 GandhiBhavan
10 Assembly
11 Lakdikapool
12 Khairtabad
13 Irrummanzil
14 Panjagutta
15 Ameerpet
16 SRnagar
17 ESIhospital
18 Erragadda
20 Bharatnagar
21 Moosapet
22 DR_BRambedkar
23 Kukatpally
24 KPHBcolony
25 JNTUcollege
26 Miyapur
27 Sultanbazar
28 Narayanguda
29 Chikkadpali
30 RTCxroads
31 Musheerabad
32 Gandhihospital
33 SecundrabadWest
34 Paradeground
35 Nagole
36 Uppal
37 stadium
38 NGRI
39 Habsiguda
40 Tarnaka
41 Mettuguda
42 SecuderabadeEast
43 Paradise
44 Rasoolpura
45 PrakashNagar
46 Begumpet
47 MathuraNagar
48 Yusufguda
49 Jubliehills
50 JH-checkpost
51 Peddamagudi
52 Madhapur
53 Dugamcheruvu
54 Hitechcity
55 Raidurg