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

IndexedLabelUndigraph

net.walend.disentangle.graph.IndexedLabelUndigraph
trait IndexedLabelUndigraph[Node, Label] extends IndexedGraph[Node] with LabelUndigraph[Node, Label]

A digraph that exposes the indices of stored nodes.

Attributes

Graph
Supertypes
trait LabelUndigraph[Node, Label]
trait Undigraph[Node]
trait IndexedGraph[Node]
trait Graph[Node]
class Object
trait Matchable
class Any
Known subtypes
class AdjacencyLabelUndigraph[Node, Label]

Members list

Concise view

Type members

Inherited classlikes

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 UndigraphInnerEdgeTrait extends InnerEdgeTrait

Attributes

Inherited from:
Undigraph
Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class InnerEdge
class InnerEdge
trait UndigraphInnerNodeTrait extends InnerNodeTrait

Attributes

Inherited from:
Undigraph
Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class InNode
class InNode

Types

type InnerNodeType <: UndigraphInnerNodeTrait & InnerIndexedNodeTrait

The type of InnerNodeTrait for this digraph representation

The type of InnerNodeTrait for this digraph representation

Attributes

Inherited types

type InnerEdgeType <: UndigraphInnerEdgeTrait

The edge type returned by this graph representation

The edge type returned by this graph representation

Attributes

Inherited from:
Undigraph
type OuterEdgeType = (NodePair[Node], Label)

The edge type used to build this graph representation

The edge type used to build this graph representation

Attributes

Inherited from:
LabelUndigraph

Value members

Abstract methods

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

Attributes

Returns:

the label connecting edge i to edge j, or noEdgeExists

Inherited methods

def edge(between: NodePair[Node]): InnerEdgeType

Attributes

Returns:

the Label between a pair of nodes, or noEdgeExistsLable if no edge exists.

Throws:
IllegalArgumentException

if either node is not in the graph

Inherited from:
LabelUndigraph
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(between: NodePair[InnerNodeType]): Label

Attributes

Returns:

the Label between a pair of nodes, or noEdgeExistsLabel if no edge exists.

Inherited from:
LabelUndigraph
def noEdgeExistsLabel: Label

Attributes

Returns:

the label to return when no edge exists

Inherited from:
LabelUndigraph
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