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

LabelUndigraph

net.walend.disentangle.graph.LabelUndigraph
trait LabelUndigraph[Node, Label] extends Undigraph[Node]

A directed graph with labeled edges.

Attributes

Since:

v0.2.1

Graph
Supertypes
trait Undigraph[Node]
trait Graph[Node]
class Object
trait Matchable
class Any
Known subtypes
trait IndexedLabelUndigraph[Node, Label]
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 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 OuterEdgeType = (NodePair[Node], Label)

The edge type used to build this graph representation

The edge type used to build this graph 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 InnerNodeType <: UndigraphInnerNodeTrait

The type of InnerNodeTrait for this digraph representation

The type of InnerNodeTrait for this digraph representation

Attributes

Inherited from:
Undigraph

Value members

Abstract 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

def label(between: NodePair[InnerNodeType]): Label

Attributes

Returns:

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

def noEdgeExistsLabel: Label

Attributes

Returns:

the label to return when no edge exists

Inherited methods

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