net.walend.graph

AdjacencyLabelDigraph

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

Provides constant-time access for successor and predecessor edges of a node.

The constructor is O(n + a ln(n))

Since

v0.1.0

Linear Supertypes
IndexedLabelDigraph[Node, Label], LabelDigraph[Node, Label], Digraph[Node], Graph[Node], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. AdjacencyLabelDigraph
  2. IndexedLabelDigraph
  3. LabelDigraph
  4. Digraph
  5. Graph
  6. AnyRef
  7. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

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

Type Members

  1. trait DigraphInnerNodeTrait extends InnerNodeTrait

    Definition Classes
    Digraph

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

  3. type InnerEdgeType = (InNode, InNode, Label)

    Definition Classes
    AdjacencyLabelDigraph → LabelDigraph → Graph

  4. trait InnerIndexedNodeTrait extends DigraphInnerNodeTrait

    An internal representation of nodes within the graph

    An internal representation of nodes within the graph

    Definition Classes
    IndexedLabelDigraph

  5. trait InnerNodeTrait extends AnyRef

    An internal representation of nodes within the graph

    An internal representation of nodes within the graph

    Definition Classes
    Graph

  6. type InnerNodeType = InNode

    The type of InnerNodeTrait for this digraph representation

    The type of InnerNodeTrait for this digraph representation

    Definition Classes
    AdjacencyLabelDigraph → IndexedLabelDigraph → Digraph → Graph

  7. type OuterEdgeType = (Node, Node, Label)

    Definition Classes
    LabelDigraph → Graph

Value Members

  1. final def !=(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  5. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  6. def edges: Seq[OuterEdgeType]

    O(n^2)

    O(n^2)

    returns

    All of the edges in the graph

    Definition Classes
    AdjacencyLabelDigraph → Graph

  7. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  8. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  9. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  10. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  11. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  12. val inNodes: IndexedSet[InNode]

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

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

  15. def innerEdges: Vector[InnerEdgeType]

    returns

    A Traversable of the edges as represented in the graph

    Definition Classes
    AdjacencyLabelDigraph → Graph

  16. 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

  17. def innerNodeForIndex(i: Int): InNode

    O(1)

    O(1)

    returns

    Definition Classes
    AdjacencyLabelDigraph → IndexedLabelDigraph

  18. def innerNodes: IndexedSet[InNode]

    O(1)

    O(1)

    returns

    InnerNode representation of all of the nodes in the graph.

    Definition Classes
    AdjacencyLabelDigraph → IndexedLabelDigraph → Graph

  19. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    O(n)

    O(n)

    returns

    Definition Classes
    AdjacencyLabelDigraph → IndexedLabelDigraph

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

    O(n)

    O(n)

    returns

    the edge between start and end or noEdgeExistsValue

    Definition Classes
    AdjacencyLabelDigraph → LabelDigraph

  22. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

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

  24. val noEdgeExistsLabel: Label

    returns

    the label to return when no edge exists

    Definition Classes
    AdjacencyLabelDigraph → LabelDigraph

  25. def node(i: Int): Node

    O(1)

    O(1)

    returns

    Definition Classes
    AdjacencyLabelDigraph → IndexedLabelDigraph

  26. def nodeCount: Int

    returns

    number of nodes in the graph

    Definition Classes
    AdjacencyLabelDigraph → Graph

  27. val nodeToInNode: Map[Node, InNode]

  28. 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 → IndexedLabelDigraph → Graph

  29. final def notify(): Unit

    Definition Classes
    AnyRef

  30. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    AnyRef

  32. def toString(): String

    Definition Classes
    AdjacencyLabelDigraph → AnyRef → Any

  33. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  35. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Deprecated Value Members

  1. def nodesSeq: IndexedSeq[Node]

    returns

    All the nodes in the graph in an indexed seq

    Definition Classes
    AdjacencyLabelDigraph → IndexedLabelDigraph
    Annotations
    @deprecated
    Deprecated

    (Since version 0.1.1) Will be removed after 0.1.1

Inherited from IndexedLabelDigraph[Node, Label]

Inherited from LabelDigraph[Node, Label]

Inherited from Digraph[Node]

Inherited from Graph[Node]

Inherited from AnyRef

Inherited from Any

Ungrouped