Class/Object

net.walend.disentangle.graph

AdjacencyUndigraph

Related Docs: object AdjacencyUndigraph | package graph

Permalink

class AdjacencyUndigraph[Node] extends IndexedUndigraph[Node]

Provides constant-time access for edges of a node.

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

Since

v0.2.1

Linear Supertypes
IndexedUndigraph[Node], Undigraph[Node], Graph[Node], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. AdjacencyUndigraph
  2. IndexedUndigraph
  3. Undigraph
  4. Graph
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new AdjacencyUndigraph(outNodes: IndexedSet[Node], adjacencyMatrix: Vector[IndexedSet[NodePair[Node]]])

    Permalink

Type Members

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

    Permalink

  2. type InnerEdgeType = NodePair[InnerNodeType]

    Permalink
    Definition Classes
    IndexedUndigraph → Graph

  3. trait InnerIndexedNodeTrait extends UndigraphInnerNodeTrait

    Permalink

    An internal representation of nodes within the graph

    An internal representation of nodes within the graph

    Definition Classes
    IndexedUndigraph

  4. trait InnerNodeTrait extends AnyRef

    Permalink

    An internal representation of nodes within the graph

    An internal representation of nodes within the graph

    Definition Classes
    Graph

  5. type InnerNodeType = InNode

    Permalink

    The type of InnerNodeTrait for this digraph representation

    The type of InnerNodeTrait for this digraph representation

    Definition Classes
    AdjacencyUndigraph → IndexedUndigraph → Undigraph → Graph

  6. type OuterEdgeType = NodePair[Node]

    Permalink
    Definition Classes
    IndexedUndigraph → Graph

  7. trait UndigraphInnerNodeTrait extends InnerNodeTrait

    Permalink
    Definition Classes
    Undigraph

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. lazy val edges: Seq[OuterEdgeType]

    Permalink

    O(n^2)

    O(n^2)

    returns

    All of the edges in the graph

    Definition Classes
    AdjacencyUndigraph → 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 inAdjacencyMatrix: Vector[IndexedSet[InnerEdgeType]]

    Permalink

  13. val inNodes: IndexedSet[InNode]

    Permalink

  14. lazy val innerEdges: Vector[InnerEdgeType]

    Permalink

    returns

    A Traversable of the edges as represented in the graph

    Definition Classes
    AdjacencyUndigraph → Graph

  15. 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
    AdjacencyUndigraph → Graph

  16. def innerNodeForIndex(i: Int): InNode

    Permalink

    O(1)

    O(1)

    Definition Classes
    AdjacencyUndigraph → IndexedUndigraph

  17. def innerNodes: IndexedSet[InNode]

    Permalink

    O(1)

    O(1)

    returns

    InnerNode representation of all of the nodes in the graph.

    Definition Classes
    AdjacencyUndigraph → IndexedUndigraph → Graph

  18. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

  20. def neighborSet(indexedSet: IndexedSet[OuterEdgeType]): IndexedSet[InnerEdgeType]

    Permalink

  21. def node(i: Int): Node

    Permalink

    O(1)

    O(1)

    Definition Classes
    AdjacencyUndigraph → IndexedUndigraph

  22. def nodeCount: Int

    Permalink

    returns

    number of nodes in the graph

    Definition Classes
    AdjacencyUndigraph → Graph

  23. val nodeToInNode: Map[Node, InNode]

    Permalink

  24. 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
    AdjacencyUndigraph → IndexedUndigraph → Graph

  25. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  26. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

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

    Permalink
    Definition Classes
    AnyRef

  28. def toString(): String

    Permalink
    Definition Classes
    AdjacencyUndigraph → AnyRef → Any

  29. final def wait(): Unit

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

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

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

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

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

Inherited from IndexedUndigraph[Node]

Inherited from Undigraph[Node]

Inherited from Graph[Node]

Inherited from AnyRef

Inherited from Any

Ungrouped