Class/Object

net.walend.disentangle.graph

AdjacencyDigraph

Related Docs: object AdjacencyDigraph | package graph

Permalink

class AdjacencyDigraph[Node] extends Tuple2Digraph[Node] with IndexedGraph[Node]

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

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

Since

v0.2.1

Linear Supertypes
IndexedGraph[Node], Tuple2Digraph[Node], Digraph[Node], Graph[Node], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. AdjacencyDigraph
  2. IndexedGraph
  3. Tuple2Digraph
  4. Digraph
  5. Graph
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new AdjacencyDigraph(outNodes: IndexedSet[Node], outSuccessors: Vector[IndexedSet[(Node, Node)]], outPredecessors: Vector[IndexedSet[(Node, Node)]])

    Permalink

Type Members

  1. trait DigraphInnerNodeTrait extends InnerNodeTrait

    Permalink
    Definition Classes
    Digraph

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

    Permalink

  3. type InnerEdgeType = (InNode, InNode)

    Permalink
    Definition Classes
    AdjacencyDigraph → Tuple2Digraph → Graph

  4. trait InnerIndexedNodeTrait extends InnerNodeTrait

    Permalink

    An internal representation of nodes within the graph

    An internal representation of nodes within the graph

    Definition Classes
    IndexedGraph

  5. trait InnerNodeTrait extends AnyRef

    Permalink

    An internal representation of nodes within the graph

    An internal representation of nodes within the graph

    Definition Classes
    Graph

  6. type InnerNodeType = InNode

    Permalink

    The type of InnerNodeTrait for this digraph representation

    The type of InnerNodeTrait for this digraph representation

    Definition Classes
    AdjacencyDigraph → IndexedGraph → Digraph → Graph

  7. type OuterEdgeType = (Node, Node)

    Permalink
    Definition Classes
    Tuple2Digraph → Graph

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

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

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

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

  6. def edges: Seq[OuterEdgeType]

    Permalink

    O(n^2)

    O(n^2)

    returns

    All of the edges in the graph

    Definition Classes
    AdjacencyDigraph → Graph

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

    Permalink
    Definition Classes
    AnyRef

  8. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  9. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  11. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  12. val inNodes: IndexedSet[InNode]

    Permalink

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

    Permalink

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

    Permalink

  15. def innerEdges: Vector[InnerEdgeType]

    Permalink

    returns

    A Traversable of the edges as represented in the graph

    Definition Classes
    AdjacencyDigraph → Graph

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

    Permalink

    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
    AdjacencyDigraph → Graph

  17. def innerNodeForIndex(i: Int): InNode

    Permalink

    O(1)

    O(1)

    Definition Classes
    AdjacencyDigraph → IndexedGraph

  18. def innerNodes: IndexedSet[InNode]

    Permalink

    O(1)

    O(1)

    returns

    InnerNode representation of all of the nodes in the graph.

    Definition Classes
    AdjacencyDigraph → IndexedGraph → Graph

  19. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

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

    Permalink

  22. def node(i: Int): Node

    Permalink

    O(1)

    O(1)

    Definition Classes
    AdjacencyDigraph → IndexedGraph

  23. def nodeCount: Int

    Permalink

    returns

    number of nodes in the graph

    Definition Classes
    AdjacencyDigraph → Graph

  24. val nodeToInNode: Map[Node, InNode]

    Permalink

  25. def nodes: IndexedSet[Node]

    Permalink

    All the nodes in the graph, in an indexed set

    All the nodes in the graph, in an indexed set

    Definition Classes
    AdjacencyDigraph → IndexedGraph → Graph

  26. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  27. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    AnyRef

  29. def toString(): String

    Permalink
    Definition Classes
    AdjacencyDigraph → AnyRef → Any

  30. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from IndexedGraph[Node]

Inherited from Tuple2Digraph[Node]

Inherited from Digraph[Node]

Inherited from Graph[Node]

Inherited from AnyRef

Inherited from Any

Ungrouped