Uses of Interface
org.apache.xmlgraphics.util.dijkstra.Vertex
Packages that use Vertex
Package
Description
Provides an image loading and processing pipeline.
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 VertexModifier and TypeClassDescriptionclassThis class represents a combination of MIME type and an image flavor. -
Uses of Vertex in org.apache.xmlgraphics.util.dijkstra
Methods in org.apache.xmlgraphics.util.dijkstra that return VertexModifier and TypeMethodDescriptionEdge.getEnd()Returns the end vertex of the edge.DijkstraAlgorithm.getPredecessor(Vertex vertex) Returns the vertex's predecessor on the shortest path.Edge.getStart()Returns the start vertex of the edge.Methods in org.apache.xmlgraphics.util.dijkstra with parameters of type VertexModifier and TypeMethodDescriptionvoidRun Dijkstra's shortest path algorithm.DefaultEdgeDirectory.getBestEdge(Vertex start, Vertex end) Returns the best edge (the edge with the lowest penalty) between two given vertices.DefaultEdgeDirectory.getDestinations(Vertex origin) Returns an iterator over all valid destinations for a given vertex.protected IteratorDijkstraAlgorithm.getDestinations(Vertex origin) Returns an iterator over all valid destinations for a given vertex.EdgeDirectory.getDestinations(Vertex origin) Returns an iterator over all valid destinations for a given vertex.Returns an iterator over all edges with the given origin.intDijkstraAlgorithm.getLowestPenalty(Vertex vertex) Returns the lowest penalty from the start point to a given vertex.intDefaultEdgeDirectory.getPenalty(Vertex start, Vertex end) Returns the penalty between two vertices.protected intDijkstraAlgorithm.getPenalty(Vertex start, Vertex end) Returns the penalty between two vertices.intEdgeDirectory.getPenalty(Vertex start, Vertex end) Returns the penalty between two vertices.DijkstraAlgorithm.getPredecessor(Vertex vertex) Returns the vertex's predecessor on the shortest path.