AdjacencyLabelDigraph

Instance Constructors

new AdjacencyLabelDigraph(outNodes: IndexedSet[Node], outSuccessors: Vector[IndexedSet[(Node, Node, Label)]], outPredecessors: Vector[IndexedSet[(Node, Node, Label)]], noEdgeExistsLabel: Label)

Type Members

trait DigraphInnerNodeTrait extends InnerNodeTrait

Definition Classes
Digraph
case class InNode(value: Node, index: Int) extends DigraphInnerNodeTrait with InnerIndexedNodeTrait with Product with Serializable
type InnerEdgeType = (InNode, InNode, Label)

Definition Classes
AdjacencyLabelDigraph → 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
type InnerNodeType = InNode

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

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

Definition Classes
LabelDigraph → Graph

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( ... )
def edges: Seq[OuterEdgeType]

O(n^2)
O(n^2)
returns
All of the edges in the graph

Definition Classes
AdjacencyLabelDigraph → Graph
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
val inNodes: IndexedSet[InNode]
val inPredecessors: Vector[IndexedSet[(InNode, InNode, Label)]]
val inSuccessors: Vector[IndexedSet[(InNode, InNode, Label)]]
def innerEdges: Vector[InnerEdgeType]

returns
A Traversable of the edges as represented in the graph

Definition Classes
AdjacencyLabelDigraph → Graph
def innerNode(value: Node): Option[InNode]

O(ln(n))
O(ln(n))
value
a node that might be in this digraph
returns
Some inner node if it exists in the digraph or None

Definition Classes
AdjacencyLabelDigraph → Graph
def innerNodeForIndex(i: Int): InNode

O(1)
O(1)

Definition Classes
AdjacencyLabelDigraph → IndexedGraph
def innerNodes: IndexedSet[InNode]

O(1)
O(1)
returns
InnerNode representation of all of the nodes in the graph.

Definition Classes
AdjacencyLabelDigraph → IndexedGraph → Graph
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def label(i: Int, j: Int): Label

O(n)
O(n)

Definition Classes
AdjacencyLabelDigraph → IndexedLabelDigraph
def label(from: InNode, to: InNode): Label

O(n)
O(n)
returns
the edge between start and end or noEdgeExistsValue

Definition Classes
AdjacencyLabelDigraph → LabelDigraph
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def neighborSet(indexedSet: IndexedSet[(Node, Node, Label)]): IndexedSet[(InNode, InNode, Label)]
val noEdgeExistsLabel: Label

returns
the label to return when no edge exists

Definition Classes
AdjacencyLabelDigraph → LabelDigraph
def node(i: Int): Node

O(1)
O(1)

Definition Classes
AdjacencyLabelDigraph → IndexedGraph
def nodeCount: Int

returns
number of nodes in the graph

Definition Classes
AdjacencyLabelDigraph → Graph
val nodeToInNode: Map[Node, InNode]
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
AdjacencyLabelDigraph → IndexedGraph → Graph
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
AdjacencyLabelDigraph → 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 Docs: object AdjacencyLabelDigraph | package graph

class AdjacencyLabelDigraph[Node, Label] extends IndexedLabelDigraph[Node, Label]

Instance Constructors

new AdjacencyLabelDigraph(outNodes: IndexedSet[Node], outSuccessors: Vector[IndexedSet[(Node, Node, Label)]], outPredecessors: Vector[IndexedSet[(Node, Node, Label)]], noEdgeExistsLabel: Label)

Type Members

trait DigraphInnerNodeTrait extends InnerNodeTrait

case class InNode(value: Node, index: Int) extends DigraphInnerNodeTrait with InnerIndexedNodeTrait with Product with Serializable

type InnerEdgeType = (InNode, InNode, Label)

trait InnerIndexedNodeTrait extends InnerNodeTrait

trait InnerNodeTrait extends AnyRef

type InnerNodeType = InNode

type OuterEdgeType = (Node, Node, Label)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def edges: Seq[OuterEdgeType]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

val inNodes: IndexedSet[InNode]

val inPredecessors: Vector[IndexedSet[(InNode, InNode, Label)]]

val inSuccessors: Vector[IndexedSet[(InNode, InNode, Label)]]

def innerEdges: Vector[InnerEdgeType]

def innerNode(value: Node): Option[InNode]

def innerNodeForIndex(i: Int): InNode

def innerNodes: IndexedSet[InNode]

final def isInstanceOf[T0]: Boolean

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

def label(from: InNode, to: InNode): Label

final def ne(arg0: AnyRef): Boolean

def neighborSet(indexedSet: IndexedSet[(Node, Node, Label)]): IndexedSet[(InNode, InNode, Label)]

val noEdgeExistsLabel: Label

def node(i: Int): Node

def nodeCount: Int

val nodeToInNode: Map[Node, InNode]

def nodes: IndexedSet[Node]

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 IndexedLabelDigraph[Node, Label]

Inherited from IndexedGraph[Node]

Inherited from LabelDigraph[Node, Label]

Inherited from Digraph[Node]

Inherited from Graph[Node]

Inherited from AnyRef

Inherited from Any

Ungrouped