IndexedLabelDigraph

Type Members

trait DigraphInnerNodeTrait extends InnerNodeTrait

Definition Classes
Digraph
type InnerEdgeType = (InnerNodeType, InnerNodeType, Label)

Definition Classes
LabelDigraph → Graph
trait InnerIndexedNodeTrait extends InnerNodeTrait

An internal representation of nodes within the graph
An internal representation of nodes within the graph

Definition Classes
IndexedGraph
trait InnerNodeTrait extends AnyRef

An internal representation of nodes within the graph
An internal representation of nodes within the graph

Definition Classes
Graph
abstract type InnerNodeType <: DigraphInnerNodeTrait with InnerIndexedNodeTrait

The type of InnerNodeTrait for this digraph representation
The type of InnerNodeTrait for this digraph representation

Definition Classes
IndexedLabelDigraph → IndexedGraph → Digraph → Graph
type OuterEdgeType = (Node, Node, Label)

Definition Classes
LabelDigraph → Graph

Abstract Value Members

abstract def edges: GenTraversable[OuterEdgeType]

returns
A Traversable (usually something more specific) of the edges

Definition Classes
Graph
abstract def innerEdges: GenTraversable[InnerEdgeType]

returns
A Traversable of the edges as represented in the graph

Definition Classes
Graph
abstract def innerNode(value: Node): Option[InnerNodeType]

value
a node that might be in this digraph
returns
Some inner node if it exists in the digraph or None

Definition Classes
Graph
abstract def innerNodeForIndex(i: Int): InnerNodeType

Definition Classes
IndexedGraph
abstract def innerNodes: IndexedSet[InnerNodeType]

returns
internal representation of all of the nodes in the graph.

Definition Classes
IndexedGraph → Graph
abstract def label(i: Int, j: Int): Label

returns
the label connecting nodes at index i and j, or noEdgeExistsLabel

Exceptions thrown
IndexOutOfBoundsException if either i or j does not correspond with a node
abstract def label(start: InnerNodeType, end: InnerNodeType): Label

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

Definition Classes
LabelDigraph
abstract def noEdgeExistsLabel: Label

returns
the label to return when no edge exists

Definition Classes
LabelDigraph
abstract def node(i: Int): Node

Definition Classes
IndexedGraph
abstract def nodeCount: Int

returns
number of nodes in the graph

Definition Classes
Graph
abstract def nodes: IndexedSet[Node]

All the nodes in the graph, in an indexed set
All the nodes in the graph, in an indexed set

Definition Classes
IndexedGraph → Graph

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package graph

trait IndexedLabelDigraph[Node, Label] extends LabelDigraph[Node, Label] with IndexedGraph[Node]

Type Members

trait DigraphInnerNodeTrait extends InnerNodeTrait

type InnerEdgeType = (InnerNodeType, InnerNodeType, Label)

trait InnerIndexedNodeTrait extends InnerNodeTrait

trait InnerNodeTrait extends AnyRef

abstract type InnerNodeType <: DigraphInnerNodeTrait with InnerIndexedNodeTrait

type OuterEdgeType = (Node, Node, Label)

Abstract Value Members

abstract def edges: GenTraversable[OuterEdgeType]

abstract def innerEdges: GenTraversable[InnerEdgeType]

abstract def innerNode(value: Node): Option[InnerNodeType]

abstract def innerNodeForIndex(i: Int): InnerNodeType

abstract def innerNodes: IndexedSet[InnerNodeType]

abstract def label(i: Int, j: Int): Label

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

abstract def noEdgeExistsLabel: Label

abstract def node(i: Int): Node

abstract def nodeCount: Int

abstract def nodes: IndexedSet[Node]

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from IndexedGraph[Node]

Inherited from LabelDigraph[Node, Label]

Inherited from Digraph[Node]

Inherited from Graph[Node]

Inherited from AnyRef

Inherited from Any

Ungrouped