Disentangle-Graph
API
Generated with
Disentangle-Graph/net.walend.disentangle.graph/IndexedLabelDigraph

IndexedLabelDigraph

net.walend.disentangle.graph.IndexedLabelDigraph
trait IndexedLabelDigraph[Node, Label] extends LabelDigraph[Node, Label] with IndexedGraph[Node]

A digraph that exposes the indices of stored nodes.

Attributes

Since:

v0.1.0

Graph
Supertypes
trait IndexedGraph[Node]
trait LabelDigraph[Node, Label]
trait Digraph[Node]
trait Graph[Node]
class Object
trait Matchable
class Any
Known subtypes
class AdjacencyLabelDigraph[Node, Label]
class MatrixLabelDigraph[Node, Label]

Members list

Concise view

Type members

Inherited classlikes

trait DigraphInnerEdgeTrait extends InnerEdgeTrait

Attributes

Inherited from:
Digraph
Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class InnerEdge
class InnerEdge
class InnerEdge
trait DigraphInnerNodeTrait extends InnerNodeTrait

Attributes

Inherited from:
Digraph
Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class InNode
class InnerNode
class InnerNode
trait InnerEdgeTrait

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
class InnerEdge
class InnerEdge
class InnerEdge
class InnerEdge
class InnerEdge
trait InnerIndexedNodeTrait extends InnerNodeTrait

An internal representation of nodes within the graph

An internal representation of nodes within the graph

Attributes

Inherited from:
IndexedGraph
Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class InNode
class InnerNode
class InNode
class InnerNode
trait InnerNodeTrait

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
class InNode
class InnerNode
class InnerNode
class InNode
class InNode
trait LabelDigraphEdgeTrait extends DigraphInnerEdgeTrait

Attributes

Inherited from:
LabelDigraph
Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class InnerEdge
class InnerEdge

Types

type InnerNodeType <: DigraphInnerNodeTrait & InnerIndexedNodeTrait

The type of InnerNodeTrait for this digraph representation

The type of InnerNodeTrait for this digraph representation

Attributes

Inherited types

override type InnerEdgeType <: LabelDigraphEdgeTrait

The edge type returned by this graph representation

The edge type returned by this graph representation

Attributes

Inherited from:
LabelDigraph
type OuterEdgeType = (Node, Node, Label)

The edge type used to build this graph representation

The edge type used to build this graph representation

Attributes

Inherited from:
LabelDigraph

Value members

Abstract methods

def label(i: Int, j: Int): Label

Attributes

Returns:

the label connecting nodes at index i and j, or noEdgeExistsLabel

Throws:
IndexOutOfBoundsException

if either i or j does not correspond with a node

Inherited methods

def edge(from: Node, to: Node): Option[InnerEdgeType]

Attributes

Inherited from:
Digraph
def edge(from: InnerNodeType, to: InnerNodeType): Option[InnerEdgeType]

Attributes

Inherited from:
Digraph
def edges: Iterable[OuterEdgeType]

Attributes

Returns:

A Traversable (usually something more specific) of the edges

Inherited from:
Graph
def innerEdges: Iterable[InnerEdgeType]

Attributes

Returns:

A Traversable of the edges as represented in the graph

Inherited from:
Graph
def innerNode(value: Node): Option[InnerNodeType]

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
def innerNodeForIndex(i: Int): InnerNodeType

Attributes

Inherited from:
IndexedGraph
def innerNodes: IndexedSet[InnerNodeType]

Attributes

Returns:

internal representation of all of the nodes in the graph.

Inherited from:
IndexedGraph
def label(start: InnerNodeType, end: InnerNodeType): Label

Attributes

Returns:

the Edge between start and end or noEdgeExistsValue if no edge connects start to end

Inherited from:
LabelDigraph
def noEdgeExistsLabel: Label

Attributes

Returns:

the label to return when no edge exists

Inherited from:
LabelDigraph
def node(i: Int): Node

Attributes

Inherited from:
IndexedGraph
def nodeCount: Int

Attributes

Returns:

number of nodes in the graph

Inherited from:
Graph
def nodes: IndexedSet[Node]

All the nodes in the graph, in an indexed set

All the nodes in the graph, in an indexed set

Attributes

Inherited from:
IndexedGraph
Generated with