public dijkstra(G, int v){
    N.push(v);
    for(int vertex: G.keySet()){
        if (G.get(v).containsKey(vertex)){
            distTO[vertex] = G.get(v).get(vertex);
            p[vertex]= v;
        }else{
            distTo[vertex] = Double.POSITIVE_INFINITY;
        }
    }
    while (N.length!=G.keySet()){

    }
}