Implementation of Dijkstra's algorithm using a graph of vertices and weighted edges. Graph class contains functions needed to construct graph data structure: add/remove vertex, add/remove edges, use ...

INTRODUCTION: This 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 ...