|
xmlgraphics-commons 1.3.1 | |||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg.apache.xmlgraphics.util.dijkstra.DefaultEdgeDirectory
public class DefaultEdgeDirectory
Default implementation of an edge directory for the DijkstraAlgorithm
.
Constructor Summary | |
---|---|
DefaultEdgeDirectory()
|
Method Summary | |
---|---|
void |
addEdge(Edge edge)
Adds a new edge between two vertices. |
Edge |
getBestEdge(Vertex start,
Vertex end)
Returns the best edge (the edge with the lowest penalty) between two given vertices. |
java.util.Iterator |
getDestinations(Vertex origin)
Returns an iterator over all valid destinations for a given vertex. |
java.util.Iterator |
getEdges(Vertex origin)
Returns an iterator over all edges with the given origin. |
int |
getPenalty(Vertex start,
Vertex end)
Returns the penalty between two vertices. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public DefaultEdgeDirectory()
Method Detail |
---|
public void addEdge(Edge edge)
edge
- the new edgepublic int getPenalty(Vertex start, Vertex end)
getPenalty
in interface EdgeDirectory
start
- the start vertexend
- the end vertex
public java.util.Iterator getDestinations(Vertex origin)
getDestinations
in interface EdgeDirectory
origin
- the origin from which to search for destinations
public java.util.Iterator getEdges(Vertex origin)
origin
- the origin
public Edge getBestEdge(Vertex start, Vertex end)
start
- the start vertexend
- the end vertex
|
xmlgraphics-commons 1.3.1 | |||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |