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

Digraph

net.walend.disentangle.graph.Digraph
trait Digraph[Node] extends Graph[Node]

A graph with directed zero or one edges from any single node to any other single node.

Attributes

Since:

v0.1.0

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

Members list

Concise view

Type members

Classlikes

trait DigraphInnerEdgeTrait extends InnerEdgeTrait

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class InnerEdge
class InnerEdge
class InnerEdge
trait DigraphInnerNodeTrait extends InnerNodeTrait

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class InNode
class InnerNode
class InnerNode

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

Types

override type InnerEdgeType <: DigraphInnerEdgeTrait

The edge type returned by this graph representation

The edge type returned by this graph representation

Attributes

override type InnerNodeType <: DigraphInnerNodeTrait

The type of InnerNodeTrait for this digraph representation

The type of InnerNodeTrait for this digraph representation

Attributes

Inherited types

type OuterEdgeType

The edge type used to build this graph representation

The edge type used to build this graph representation

Attributes

Inherited from:
Graph

Value members

Abstract methods

Concrete methods

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

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