net.walend.disentangle.graph.IndexedGraph
A graph that exposes the indices of stored nodes.
Implementers should also include some accessor for edges via indexes.
Attributes
- Since:
v0.2.1
- Graph
- Supertypes
class Object
trait Matchable
class Any
- Known subtypes
Members list
Concise view
Type members
An internal representation of nodes within the graph
An internal representation of nodes within the graph
Attributes
- Graph
- Supertypes
class Object
trait Matchable
class Any
- 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 Object
trait Matchable
class Any
- Known subtypes
An internal representation of nodes within the graph
An internal representation of nodes within the graph
Attributes
- Inherited from:
- Graph
- Graph
- Supertypes
class Object
trait Matchable
class Any
- Known subtypes
The type of InnerNodeTrait for this digraph representation
The type of InnerNodeTrait for this digraph representation
Attributes
The edge type returned by this graph representation
The edge type returned by this graph representation
Attributes
- Inherited from:
- Graph
The edge type used to build this graph representation
The edge type used to build this graph representation
Attributes
- Inherited from:
- Graph
Value members
Attributes
- Returns:
internal representation of all of the nodes in the graph.
All the nodes in the graph, in an indexed set
All the nodes in the graph, in an indexed set
Attributes
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:
number of nodes in the graph
- Inherited from:
- Graph