vasuksh/Dijkstra-Algorithm-efficient-implementation

Using Dijkstra’s Algorithm to find the shortest path between two destination which will be used for flight/train bookings. Time complexity: O(V + E log(E))

C++