A Walk is a possibly empty sequence of edges connecting two vertices.

By: ThorstenSeitz

no type hierarchy

no subtypes hierarchy

Attributes
edgesSource Codeshared formal {E*} edges

The edges comprising the walk.

emptySource Codeshared Boolean empty

Answer whether the walk is empty.

endpointSource Codeshared default V? endpoint

The vertex where the walk end or none if the walk is empty.

lengthSource Codeshared Integer length

The length of the walk, i.e. the number of edges.

notEmptySource Codeshared Boolean notEmpty

Answer whether the walk is not empty.

startpointSource Codeshared default V? startpoint

The vertex where the walk starts or none if the walk is empty.

verticesSource Codeshared {V*} vertices

The vertices touched by the walk.

Inherited Attributes
Attributes inherited from: Object
Methods
compareSource Codeshared actual default Comparison compare(Walk<V,E> other)

Compare walks by length.

distanceSource Codeshared Weight distance<Weight>(Weights<Weight,V,E> weights)
given Weight satisfies Summable<Weight>

The distance of a walk with recpect to the given Weights.

Inherited Methods
Methods inherited from: Object
Methods inherited from: Comparable<Other>