public class SearchResultWrappedPath extends AbstractPath
Constructor and Description |
---|
SearchResultWrappedPath(SearchResult predecessorMatrix,
int source,
int destination) |
Modifier and Type | Method and Description |
---|---|
AbstractPath |
clone() |
boolean |
containsVertex(int someVertex) |
void |
extend(int e,
int v) |
int |
getDestination()
The last vertex in the path
|
int |
getEdgeHeadingToVertexAt(int i) |
int |
getNumberOfVertices() |
int |
getSource()
The first vertex in the path
|
int |
getVertexAt(int i) |
int |
indexOfVertex(int v) |
boolean |
isShortestPath(Grph g,
NumericalProperty weights)
Checks whether this path is a shortest path in the given graph.
|
static void |
main(java.lang.String[] args) |
void |
reverse() |
void |
setSource(int v) |
int[] |
toVertexArray()
Computes the sequence of vertices as an array of ints.
|
equals, equals, extend, getLength, getVertexSet, hashCode, hasLoop, isApplicable, isCycle, isElementary, isHamiltonian, permitsSameTrip, setColor, toString, toVertexSet, whyNotApplicable
public SearchResultWrappedPath(SearchResult predecessorMatrix, int source, int destination)
public int getSource()
Path
public int getDestination()
Path
public int getNumberOfVertices()
public int[] toVertexArray()
Path
public boolean isShortestPath(Grph g, NumericalProperty weights)
AbstractPath
isShortestPath
in interface Path
isShortestPath
in class AbstractPath
public boolean containsVertex(int someVertex)
public void setSource(int v)
public int getVertexAt(int i)
public AbstractPath clone()
clone
in interface Path
clone
in class AbstractPath
public int indexOfVertex(int v)
public void extend(int e, int v)
public void reverse()
public int getEdgeHeadingToVertexAt(int i)
public static void main(java.lang.String[] args)