private Vertex<Integer> getVertexForEdge(Vertex<Integer> v, Edge<Integer> e){
        return e.getVertex1().equals(v) ? e.getVertex2() : e.getVertex1();
    }
Date 10/11/2014
@author Tushar Roy

Find single source shortest path using Dijkstra's algorithm

Space complexity - O(E + V)
Time complexity - O(ElogV)

References
https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm
CLRS book
src/com/interview/graph/DijkstraShortestPath.java