{"id":21229378,"url":"https://github.com/shibam120302/dijkstras_algorithm_hydmetro","last_synced_at":"2026-03-07T22:32:51.260Z","repository":{"id":156954031,"uuid":"590141114","full_name":"shibam120302/Dijkstras_algorithm_HYDmetro","owner":"shibam120302","description":"This is CPP code for real time use case of Dijkstras algorithm to find the shortest path from source to every destination","archived":false,"fork":false,"pushed_at":"2023-01-17T18:41:58.000Z","size":305,"stargazers_count":3,"open_issues_count":0,"forks_count":2,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-13T23:53:38.435Z","etag":null,"topics":["dijkstras-algorithm","dijkstras-pathfinder","dsa-algorithm","dsa-project"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/shibam120302.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-01-17T18:41:08.000Z","updated_at":"2025-04-09T08:08:37.000Z","dependencies_parsed_at":null,"dependency_job_id":"d581fc9b-de57-472d-93bd-ed26a3926d95","html_url":"https://github.com/shibam120302/Dijkstras_algorithm_HYDmetro","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/shibam120302/Dijkstras_algorithm_HYDmetro","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shibam120302%2FDijkstras_algorithm_HYDmetro","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shibam120302%2FDijkstras_algorithm_HYDmetro/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shibam120302%2FDijkstras_algorithm_HYDmetro/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shibam120302%2FDijkstras_algorithm_HYDmetro/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/shibam120302","download_url":"https://codeload.github.com/shibam120302/Dijkstras_algorithm_HYDmetro/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shibam120302%2FDijkstras_algorithm_HYDmetro/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":30234676,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-03-07T19:01:10.287Z","status":"ssl_error","status_checked_at":"2026-03-07T18:59:58.103Z","response_time":53,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["dijkstras-algorithm","dijkstras-pathfinder","dsa-algorithm","dsa-project"],"created_at":"2024-11-20T23:27:05.839Z","updated_at":"2026-03-07T22:32:51.237Z","avatar_url":"https://github.com/shibam120302.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Dijkstras-algorithm-HYDmetro\n***INTRODUCTION:***\nThis C++ code implements real time use case of Dijkstras algorithm to find the shortest path from source to every destination.There are 56 metro stations in Hyderabad. Considering each station an integer value starting from 0 is assigned,when the user enters the source station Dijkstras algorithm is applied and least no of stations from the source to every other station is calculated and displayed.\n\n***COMPLEXITY:***\nThe time complexity of Dijkstras algorithm is O(V^2),where V is the number of vertices in the graph.The space complexity of Dijkstras algorithm is O(V)\n\n\n# STATION CODES\n Node number Station Name\n \n 0 LBnagar\n 1 Victoria_memorial\n 2 Chaitanyapuri\n 3 Dilshukhnagar\n 4 Moosrambagh\n 5 New Market\n 6 Malakpet\n 7 MG BusStation\n 8 Osmania_medical\n 9 GandhiBhavan\n 10 Assembly\n 11 Lakdikapool\n 12 Khairtabad\n 13 Irrummanzil\n 14 Panjagutta\n 15 Ameerpet\n 16 SRnagar\n 17 ESIhospital\n 18 Erragadda\n 20 Bharatnagar\n 21 Moosapet\n 22 DR_BRambedkar\n 23 Kukatpally\n 24 KPHBcolony\n 25 JNTUcollege\n 26 Miyapur\n 27 Sultanbazar\n 28 Narayanguda\n 29 Chikkadpali\n 30 RTCxroads\n 31 Musheerabad\n 32 Gandhihospital\n 33 SecundrabadWest\n 34 Paradeground\n 35 Nagole\n 36 Uppal\n 37 stadium\n 38 NGRI\n 39 Habsiguda\n 40 Tarnaka\n 41 Mettuguda\n 42 SecuderabadeEast\n 43 Paradise\n 44 Rasoolpura\n 45 PrakashNagar\n 46 Begumpet\n 47 MathuraNagar\n 48 Yusufguda\n 49 Jubliehills\n 50 JH-checkpost\n 51 Peddamagudi\n 52 Madhapur\n 53 Dugamcheruvu\n 54 Hitechcity\n 55 Raidurg\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshibam120302%2Fdijkstras_algorithm_hydmetro","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fshibam120302%2Fdijkstras_algorithm_hydmetro","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshibam120302%2Fdijkstras_algorithm_hydmetro/lists"}