Disentangle-Graph/net.walend.disentangle.graph/IndexedUndigraph

IndexedUndigraph

net.walend.disentangle.graph.IndexedUndigraph

trait IndexedUndigraph[Node] extends Undigraph[Node]

A digraph that exposes the indices of stored nodes.

Attributes

Graph
Supertypes: trait Undigraph[Node]
trait Graph[Node]
class Object
trait Matchable
class Any
Known subtypes: class AdjacencyUndigraph[Node]

Members list

Concise view

Type members

Classlikes

An internal representation of nodes within the graph

Attributes

Graph
Supertypes: trait UndigraphInnerNodeTrait
trait InnerNodeTrait
class Object
trait Matchable
class Any
Known subtypes: class InNode

Inherited classlikes

An internal representation of edges within the graph

Attributes

Inherited from:: Graph
Graph
Supertypes: class Object
trait Matchable
class Any
Known subtypes: trait DigraphInnerEdgeTrait
class InnerEdge
trait LabelDigraphEdgeTrait
class InnerEdge
class InnerEdge
trait UndigraphInnerEdgeTrait
class InnerEdge
class InnerEdge

An internal representation of nodes within the graph

Attributes

Inherited from:: Graph
Graph
Supertypes: class Object
trait Matchable
class Any
Known subtypes: trait DigraphInnerNodeTrait
class InNode
class InnerNode
class InnerNode
trait InnerIndexedNodeTrait
class InNode
trait UndigraphInnerNodeTrait
trait InnerIndexedNodeTrait
class InNode

Attributes

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

Attributes

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

Types

The type of InnerNodeTrait for this digraph representation

Attributes

The edge type used to build this graph representation

Attributes

Inherited types

The edge type returned by this graph representation

Attributes

Inherited from:: Undigraph

Value members

Abstract methods

Attributes

Returns:: internal representation of all of the nodes in the graph.

All the nodes in the graph, in an indexed set

Attributes

Inherited methods

Attributes

Returns:: A Traversable (usually something more specific) of the edges
Inherited from:: Graph

Attributes

Returns:: A Traversable of the edges as represented in the graph
Inherited from:: Graph

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

Attributes

Returns:: number of nodes in the graph
Inherited from:: Graph

Generated with