modulegraph0.0.1
Source Code
graph
classHops<V, E>
extends Basic
satisfies Weights<Integer,V,E>
given V satisfies Object
given E satisfies Edge<V,E>
OverviewPackageAttributesInitializerMethods

Hops assigns an edge the weight of 1 and can therefore be used to count the number of edges, or 'hops' between two vertices.

By: ThorstenSeitz

no subtypes hierarchy

Initializer
Hops()
Attributes
zeroSource Codeshared actual Integer zero= 0
Refines Monoid.zero (zero)
Inherited Attributes
Attributes inherited from: Object
Object.hash, Object.string
Attributes inherited from: Monoid<T,M>
zero
Methods
weightSource Codeshared actual Integer weight(E edge)
Refines Weights.weight
Inherited Methods
Methods inherited from: Object
Object.equals()
Methods inherited from: Monoid<T,M>
plus
Methods inherited from: Weights<Weight,Vertex,E>
Weights.weight()