public interface Path extends Graph
The important word here is consecutive. Thus, implementations are required to make sure that if an Edge is added to a Path, that the Edge being added is between the last Vertex in the path to a new Vertex. If a Vertex is being added, that am Edge is created between the last Vertex in the Path to the new Vertex being added.
If an acyclic path is required, then implement the AcyclicPath interface instead.
| Modifier and Type | Method and Description |
|---|---|
Vertex |
getFirstVertex()
Returns the first Vertex in the Path.
|
Vertex |
getLastVertex()
Returns the last Vertex in the Path.
|
void |
remove()
Removes the last Vertex that was added in the Path.
|
add, addEdge, addEdge, addGraphAddEdgeListener, addGraphAddVertexListener, addGraphRemoveEdgeListener, addGraphRemoveVertexListener, addListener, cloneVertices, getAdjacentVertices, getAdjacentVertices, getConnectedSet, getConnectedSet, getDegree, getDegree, getEdges, getEdgesCount, getEdgeSet, getGraphFactory, getTraversal, getVertexSet, getVertices, getVerticesCount, getVerticesIterator, isConnected, remove, removeEdge, removeEdges, removeGraphAddEdgeListener, removeGraphAddVertexListener, removeGraphRemoveEdgeListener, removeGraphRemoveVertexListener, removeListener, setGraphFactory, setTraversal, traverseCopyright © 2019 JULIE Lab, Germany. All rights reserved.