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

LabelDigraph

net.walend.disentangle.graph.LabelDigraph
trait LabelDigraph[Node, Label] extends Digraph[Node]

A directed graph with labeled edges.

Attributes

Since:

v0.1.0

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

Members list

Concise view

Type members

Classlikes

trait LabelDigraphEdgeTrait extends DigraphInnerEdgeTrait

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class InnerEdge
class InnerEdge

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 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

Types

override type InnerEdgeType <: LabelDigraphEdgeTrait

The edge type returned by this graph representation

The edge type returned by this graph representation

Attributes

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 types

override type InnerNodeType <: DigraphInnerNodeTrait

The type of InnerNodeTrait for this digraph representation

The type of InnerNodeTrait for this digraph representation

Attributes

Inherited from:
Digraph

Value members

Abstract methods

def label(start: InnerNodeType, end: InnerNodeType): Label

Attributes

Returns:

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

def noEdgeExistsLabel: Label

Attributes

Returns:

the label to return when no edge exists

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 innerNodes: Set[InnerNodeType]

Attributes

Returns:

InnerNode representation of all of the nodes in the graph.

Inherited from:
Graph
def nodeCount: Int

Attributes

Returns:

number of nodes in the graph

Inherited from:
Graph
def nodes: Set[Node]

All the nodes in the graph

All the nodes in the graph

Attributes

Inherited from:
Graph
Generated with