A Walk is a possibly empty sequence of edges connecting two vertices.
no type hierarchy
no subtypes hierarchy
| Attributes | |
edges | Source Codeshared formal {E*} edgesThe edges comprising the walk. |
empty | Source Codeshared Boolean emptyAnswer whether the walk is empty. |
endpoint | Source Codeshared default V? endpointThe vertex where the walk end or none if the walk is empty. |
length | Source Codeshared Integer lengthThe length of the walk, i.e. the number of edges. |
notEmpty | Source Codeshared Boolean notEmptyAnswer whether the walk is not empty. |
startpoint | Source Codeshared default V? startpointThe vertex where the walk starts or none if the walk is empty. |
vertices | Source Codeshared {V*} verticesThe vertices touched by the walk. |
| Inherited Attributes |
Attributes inherited from: Object |
| Methods | |
compare | Source Codeshared actual default Comparison compare(Walk<V,E> other)Compare walks by length. Refines Comparable.compare |
distance | Source Codeshared Weight distance<Weight>(Weights<Weight,V,E> weights)The distance of a walk with recpect to the given |
| Inherited Methods |
Methods inherited from: Object |
Methods inherited from: Comparable<Other> |