Cacher is the code snippet organizer for pro developers

public class Dijkstra {
    // s stands for the start point
	private Graph graph;
    //priority queue stores all of the nodes, reachable from the start node
    //The queue is sorted by the node.distance 
    private GraphNodePriorityQueue priorityQ = new GraphNodePriorityQueue();
    private Hashtable <GraphNode,Integer> distance = new Hashtable<GraphNode, Integer>();
    
    //1. needs to get the list of all nodes in the graph
    //2. need to initialize distance vector to infinity
    //3. Need Edge Cost function
    public Dijkstra (Graph g){
            this.graph = g;
            this.graph.getStartNode().setDistance(0);
            this.priorityQ.add(this.graph.getAllNodes());
    }
    /**
    * Actual algorithm
    */
    public void go(){
            while (this.priorityQ.hasMore()){
                    GraphNode n = this.priorityQ.remove();
                    for (Edge e: n.getOutGoingEdges()){
                            GraphNode adjNode = e.getNode();
                            Integer newPossiblePathCost = e.getCost() + n.getDistance();
                            if (newPossiblePathCost<adjNode.getDistance()){
                                    adjNode.setDistance(newPossiblePathCost);
                                    this.priorityQ.updateGraphNodeDistance(adjNode);
                            }
                    }
            }       
    }
    /**
    * 
    */
    public void PrintStatusOfPriorityQ(){
            this.priorityQ.PrintContents();
    }

}