Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV CLASS NEXT CLASS | FRAMES NO FRAMES
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD

## edu.uci.ics.jung.algorithms.shortestpath
Class DijkstraDistance.VertexComparator

    java.lang.Object
      edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance.VertexComparator

All Implemented Interfaces:
  Comparator

Enclosing class:
  DijkstraDistance

protected class DijkstraDistance.VertexComparator
extends Object
implements Comparator

Compares according to distances, so that the BinaryHeap knows how to order the tree.

Constructor Summary
`DijkstraDistance.VertexComparator(Map distances)`

Method Summary
`int` | `compare(Object o1, Object o2)`

Methods inherited from class java.lang.Object
`clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait`

Methods inherited from interface java.util.Comparator
`equals`

Constructor Detail

### DijkstraDistance.VertexComparator

    public DijkstraDistance.VertexComparator(Map distances)

Method Detail

### compare

    public int compare(Object o1,
                       Object o2)

  Specified by:
    `compare` in interface `Comparator`

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV CLASS NEXT CLASS | FRAMES NO FRAMES
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD