Tuple2Digraph
A directed graph with edges expressed as Tuple2s so that you can create edges with "a->b" in your code.
Attributes
- Since:
v0.2.1
- Graph
- Supertypes
- Known subtypes
- class AdjacencyDigraph[Node]
Members list
Type members
Inherited classlikes
Attributes
- Inherited from:
- Digraph
- Graph
- Supertypes
- Known subtypes
Attributes
- Inherited from:
- Digraph
- Graph
- Supertypes
- Known subtypes
An internal representation of edges within the graph
An internal representation of edges within the graph
Attributes
- Inherited from:
- Graph
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
- Known subtypes
- trait DigraphInnerEdgeTraitclass InnerEdgetrait LabelDigraphEdgeTraitclass InnerEdgeclass InnerEdgetrait UndigraphInnerEdgeTraitclass InnerEdgeclass InnerEdge
An internal representation of nodes within the graph
An internal representation of nodes within the graph
Attributes
- Inherited from:
- Graph
- Graph
- Supertypes
- class Objecttrait Matchableclass Any
- Known subtypes
- trait DigraphInnerNodeTraitclass InNodeclass InnerNodeclass InnerNodetrait InnerIndexedNodeTraitclass InNodetrait UndigraphInnerNodeTraittrait InnerIndexedNodeTraitclass InNode
Types
The edge type used to build this graph representation
The edge type used to build this graph representation
Attributes
Inherited types
The edge type returned by this graph representation
The type of InnerNodeTrait for this digraph representation
Value members
Inherited methods
Attributes
- Inherited from:
- Digraph
Attributes
- Inherited from:
- Digraph
Attributes
- Returns:
A Traversable (usually something more specific) of the edges
- Inherited from:
- Graph
Attributes
- Returns:
A Traversable of the edges as represented in the graph
- Inherited from:
- Graph
Attributes
- value
a node that might be in this digraph
- Returns:
Some inner node if it exists in the digraph or None
- Inherited from:
- Graph
Attributes
- Returns:
InnerNode representation of all of the nodes in the graph.
- Inherited from:
- Graph