xmlgraphics-commons 1.3.1

Uses of Interface
org.apache.xmlgraphics.util.dijkstra.Vertex

Packages that use Vertex
org.apache.xmlgraphics.image.loader.pipeline Provides an image loading and processing pipeline. 
org.apache.xmlgraphics.util.dijkstra Contains an implementation of Dijkstra's shortest path algorithm. 
 

Uses of Vertex in org.apache.xmlgraphics.image.loader.pipeline
 

Classes in org.apache.xmlgraphics.image.loader.pipeline that implement Vertex
 class ImageRepresentation
          This class represents a combination of MIME type and an image flavor.
 

Methods in org.apache.xmlgraphics.image.loader.pipeline that return Vertex
 Vertex ImageConversionEdge.getEnd()
          Returns the end vertex of the edge.
 Vertex ImageConversionEdge.getStart()
          Returns the start vertex of the edge.
 

Uses of Vertex in org.apache.xmlgraphics.util.dijkstra
 

Methods in org.apache.xmlgraphics.util.dijkstra that return Vertex
 Vertex Edge.getEnd()
          Returns the end vertex of the edge.
 Vertex DijkstraAlgorithm.getPredecessor(Vertex vertex)
          Returns the vertex's predecessor on the shortest path.
 Vertex Edge.getStart()
          Returns the start vertex of the edge.
 

Methods in org.apache.xmlgraphics.util.dijkstra with parameters of type Vertex
 void DijkstraAlgorithm.execute(Vertex start, Vertex destination)
          Run Dijkstra's shortest path algorithm.
 Edge DefaultEdgeDirectory.getBestEdge(Vertex start, Vertex end)
          Returns the best edge (the edge with the lowest penalty) between two given vertices.
 java.util.Iterator DefaultEdgeDirectory.getDestinations(Vertex origin)
          Returns an iterator over all valid destinations for a given vertex.
 java.util.Iterator EdgeDirectory.getDestinations(Vertex origin)
          Returns an iterator over all valid destinations for a given vertex.
protected  java.util.Iterator DijkstraAlgorithm.getDestinations(Vertex origin)
          Returns an iterator over all valid destinations for a given vertex.
 java.util.Iterator DefaultEdgeDirectory.getEdges(Vertex origin)
          Returns an iterator over all edges with the given origin.
 int DijkstraAlgorithm.getLowestPenalty(Vertex vertex)
          Returns the lowest penalty from the start point to a given vertex.
 int DefaultEdgeDirectory.getPenalty(Vertex start, Vertex end)
          Returns the penalty between two vertices.
 int EdgeDirectory.getPenalty(Vertex start, Vertex end)
          Returns the penalty between two vertices.
protected  int DijkstraAlgorithm.getPenalty(Vertex start, Vertex end)
          Returns the penalty between two vertices.
 Vertex DijkstraAlgorithm.getPredecessor(Vertex vertex)
          Returns the vertex's predecessor on the shortest path.
 


xmlgraphics-commons 1.3.1

Copyright 1999-2008 The Apache Software Foundation. All Rights Reserved.