INTRODUCTION:This project represents a real-time use case of Dijkstra's algorithm to efficiently find the shortest path from a given source station to all other 55 metro stations in Hyderabad. The algorithm takes the source station as input from the user and calculates the minimum number of stations needed to reach every destination, providing an optimal route display.
COMPLEXITY: The time complexity of this code is O(V^2) where V is the number of vertices in the graph, due to the nested loop in the dijkstra function. The space complexity is O(V) since the code uses arrays of size V to store distance and status information for each vertex.
Node number Station Name
0 LB Nagar
1 Victoria_memorial
2 Chaitanyapuri
3 Dilshukhnagar
4 Musarambagh
5 New Market
6 Malakpet
7 MG Bus Station
8 Osmania Medical College
9 GandhiBhavan
10 Nampally
11 Assembly
12 Lakdi-ka-pul
13 Khairtabad
14 Irrummanzil
15 Panjagutta
16 Ameerpet
17 SRnagar
18 ESIhospital
19 Erragadda
20 Bharatnagar
21 Moosapet
22 Balanagar
23 Kukatpally
24 KPHB Colony
25 JNTU College
26 Miyapur
27 Sultanbazar
28 Narayanguda
29 Chikkadpali
30 RTC X Roads
31 Musheerabad
32 Gandhihospital
33 SecunderabadWest
34 Paradeground
35 Nagole
36 Uppal
37 Stadium
38 NGRI
39 Habsiguda
40 Tarnaka
41 Mettuguda
42 Secunderabad East
43 Paradise
44 Rasoolpura
45 PrakashNagar
46 Begumpet
47 MathuraNagar
48 Yusufguda
49 Road No-5 Jubileehills
50 JH-checkpost
51 Peddamma Gudi
52 Madhapur
53 Dugam Cheruvu
54 Hitec City
55 Raidurg