net.walend.graph

MatrixLabelDigraph

class MatrixLabelDigraph[Node, Label] extends IndexedLabelDigraph[Node, Label] with MutableLabelDigraph[Node, Label]

Provides constant-time access and mutator for edges. Stores Nodes in a Vector and Labels in a Vector of ArrayBuffers.

The constructor is O(n)

Since

v0.1.0

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

Instance Constructors

  1. new MatrixLabelDigraph(outNodes: IndexedSet[Node], edgeMatrix: Vector[ArrayBuffer[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
    MatrixLabelDigraphLabelDigraphGraph
  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
    MatrixLabelDigraphIndexedLabelDigraphDigraphGraph
  7. type OuterEdgeType = (Node, Node, Label)

    Definition Classes
    LabelDigraphGraph

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: Vector[(Node, Node, Label)]

    O(n^2)

    O(n^2)

    returns

    All of the edges in the graph

    Definition Classes
    MatrixLabelDigraphGraph
  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. def innerEdges: Vector[InnerEdgeType]

    returns

    A Traversable of the edges as represented in the graph

    Definition Classes
    MatrixLabelDigraphGraph
  14. 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
    MatrixLabelDigraphGraph
  15. def innerNodeForIndex(i: Int): InNode

    O(1)

    O(1)

    Definition Classes
    MatrixLabelDigraphIndexedLabelDigraph
  16. def innerNodes: IndexedSet[InNode]

    O(n)

    O(n)

    returns

    InnerNode representation of all of the nodes in the graph.

    Definition Classes
    MatrixLabelDigraphIndexedLabelDigraphGraph
  17. final def isInstanceOf[T0]: Boolean

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

    O(1)

    O(1)

    Definition Classes
    MatrixLabelDigraphIndexedLabelDigraph
  19. def label(from: InNode, to: InNode): Label

    O(1)

    O(1)

    returns

    the edge between start and end or noEdgeExistsValue

    Definition Classes
    MatrixLabelDigraphLabelDigraph
  20. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  21. val noEdgeExistsLabel: Label

    returns

    the label to return when no edge exists

    Definition Classes
    MatrixLabelDigraphLabelDigraph
  22. def node(i: Int): Node

    O(1)

    O(1)

    Definition Classes
    MatrixLabelDigraphIndexedLabelDigraph
  23. def nodeCount: Int

    O(1)

    O(1)

    returns

    number of nodes in the graph

    Definition Classes
    MatrixLabelDigraphGraph
  24. val nodeToInNode: Map[Node, InNode]

  25. 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
    MatrixLabelDigraphIndexedLabelDigraphGraph
  26. def nodesSeq: IndexedSeq[Node]

    O(1)

    O(1)

    returns

    All the nodes in the graph in an indexed seq

    Definition Classes
    MatrixLabelDigraphIndexedLabelDigraph
  27. final def notify(): Unit

    Definition Classes
    AnyRef
  28. final def notifyAll(): Unit

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

    Definition Classes
    AnyRef
  30. def toString(): String

    Definition Classes
    MatrixLabelDigraph → AnyRef → Any
  31. def upsertEdge(from: InNode, to: InNode, label: Label): Unit

    O(1)

    O(1)

    Definition Classes
    MatrixLabelDigraphMutableLabelDigraph
  32. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from MutableLabelDigraph[Node, Label]

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