modulegraph0.0.1
Source Code
graph.implicit
classImplicitAdjacencyGraph<V>
extends Basic
satisfies AdjacencyGraph<V>
given V satisfies Object
OverviewPackageAttributesInitializerMethodsNested Interfaces

Implementation of an implicit adjacency graph defined by a root vertex and a neighbors function.

By: ThorstenSeitz
Initializer
ImplicitAdjacencyGraph(V root, {V*} neighbors(V vertex))
Parameters:
  • neighbors

    All neighbor vertices of the given vertex. A neighbor is the target of an outgoing directed edge

         or the other endpoint of an undirected edge.
Attributes
emptySource Codeshared actual default Boolean empty

Answer whether the graph is empty, i.e. contains no vertices.

Refines AdjacencyGraph.empty
Inherited Attributes
Attributes inherited from: Object
Object.hash, Object.string
Attributes inherited from: AdjacencyGraph<V>
AdjacencyGraph.empty, AdjacencyGraph.notEmpty
Methods
bfsTraversalSource Codeshared VertexTraversal bfsTraversal(V start, VertexVisitor visitor = ...)

Breadth first traversal of the receiver.

Parameters:
  • visitor = traversalVisitors.nullVertexVisitor<V>()
neighborsSource Codeshared actual default {V*} neighbors(V vertex)

All neighbor vertices of the given vertex. A neighbor is the target of an outgoing directed edge

     or the other endpoint of an undirected edge.
Refines AdjacencyGraph.neighbors
Inherited Methods
Methods inherited from: Object
Object.equals()
Methods inherited from: AdjacencyGraph<V>
AdjacencyGraph.containsEdge(), AdjacencyGraph.degreeOf(), AdjacencyGraph.forEachNeighbor(), AdjacencyGraph.hasNeighbors(), AdjacencyGraph.neighbors()
Nested Interfaces
VertexTraversalSource Codeshared VertexTraversal
VertexVisitorSource Codeshared VertexVisitor