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

Graph

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

Ancestor trait for a variety of Graphs.

A graph has Nodes that can be distinguished from each other. An InnerNodeType provides access to a nodes place in the graph.

I've pulled definitions from Wikipedia: http://en.wikipedia.org/wiki/Graph_(mathematics) where possible

Attributes

Since:

v0.1.0

Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
trait Digraph[Node]
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]
trait IndexedGraph[Node]
trait IndexedLabelUndigraph[Node, Label]
class AdjacencyLabelUndigraph[Node, Label]
trait Undigraph[Node]
trait IndexedUndigraph[Node]
class AdjacencyUndigraph[Node]
trait LabelUndigraph[Node, Label]

Members list

Concise view

Type members

Classlikes

trait InnerEdgeTrait

An internal representation of edges within the graph

An internal representation of edges within the graph

Attributes

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

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

Types

type InnerEdgeType <: InnerEdgeTrait

The edge type returned by this graph representation

The edge type returned by this graph representation

Attributes

type InnerNodeType <: InnerNodeTrait

The node type returned by graph representation

The node type returned by graph representation

Attributes

type OuterEdgeType

The edge type used to build this graph representation

The edge type used to build this graph representation

Attributes

Value members

Abstract methods

def edges: Iterable[OuterEdgeType]

Attributes

Returns:

A Traversable (usually something more specific) of the edges

def innerEdges: Iterable[InnerEdgeType]

Attributes

Returns:

A Traversable of the edges as represented in the 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

def innerNodes: Set[InnerNodeType]

Attributes

Returns:

InnerNode representation of all of the nodes in the graph.

def nodeCount: Int

Attributes

Returns:

number of nodes in the graph

def nodes: Set[Node]

All the nodes in the graph

All the nodes in the graph

Attributes

Generated with