Beispiel #1
0
 public void relaxEdges(FibonacciHeap<Vertex> unvisited) {
   Vertex[] vertices = Graph.this.vertices;
   for (Edge edge : edges) {
     Vertex to = vertices[edge.to];
     int newDistance = distance + edge.cost;
     if (newDistance < to.distance) {
       to.distance = newDistance;
       unvisited.decreaseKey(to.heapEntry, newDistance);
     }
   }
 }