co.teapot.tempest.graph

ConcurrentHashMapDynamicGraph

Related Docs: object ConcurrentHashMapDynamicGraph | package graph

class ConcurrentHashMapDynamicGraph extends DynamicDirectedGraph

An efficient dynamic graph implementation which supports concurrent reading and writing. Locks are only used by writing threads. Nodes are stored in a ConcurrentHashMap. Multi-edges are allowed (multiple copies of an edge may exist in the graph). Node count and edge count are both available.

Linear Supertypes
DynamicDirectedGraph, DirectedGraph, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. ConcurrentHashMapDynamicGraph
  2. DynamicDirectedGraph
  3. DirectedGraph
  4. AnyRef
  5. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ConcurrentHashMapDynamicGraph()

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. var _edgeCount: AtomicLong

  5. var _maxNodeId: AtomicInteger

  6. def addEdge(id1: Int, id2: Int): Unit

    Adds the given edge to the graph, increasing the number of nodes if needed.

    Adds the given edge to the graph, increasing the number of nodes if needed.

    Definition Classes
    ConcurrentHashMapDynamicGraph → DynamicDirectedGraph

  7. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  8. def clone(): AnyRef

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

  9. def defaultNeighbors(id: Int): IndexedSeq[Int]

    Called by other methods when given an id that doesn't exist in this graph.

    Called by other methods when given an id that doesn't exist in this graph. By default it throws an exception, but implementations can override it to return an IndexedSeq which is the neighbor seq of non-existing nodes (typically an empty IndexedSeq).

    Definition Classes
    DirectedGraph

  10. def edgeCount: Long

    The number of edges in this graph.

    The number of edges in this graph.

    Definition Classes
    ConcurrentHashMapDynamicGraph → DirectedGraph

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

    Definition Classes
    AnyRef

  12. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  13. def existsNode(id: Int): Boolean

    Definition Classes
    ConcurrentHashMapDynamicGraph → DirectedGraph

  14. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  16. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  17. def inDegree(id: Int): Int

    Returns the number of in-neighbors of the given id.

    Returns the number of in-neighbors of the given id.

    Definition Classes
    ConcurrentHashMapDynamicGraph → DirectedGraph

  18. def inDegreeOr0(id: Int): Int

    Returns the in-degree of the given node id, or 0 if the node id does not exist.

    Returns the in-degree of the given node id, or 0 if the node id does not exist.

    Definition Classes
    DirectedGraph

  19. def inNeighbor(id: Int, i: Int): Int

    Returns the ith in-neighbor of the node with the given id.

    Returns the ith in-neighbor of the node with the given id. Throws IndexOutOfBoundsException unless 0 <= i < inDegree(id).

    Definition Classes
    DirectedGraph

  20. def inNeighborList(id: Int): List[Integer]

    Returns the in-neighbors of the given id as a java.util.List.

    Returns the in-neighbors of the given id as a java.util.List.

    Definition Classes
    DirectedGraph

  21. def inNeighbors(id: Int): IndexedSeq[Int]

    Returns the in-neighbors of the given id.

    Returns the in-neighbors of the given id. Throws NoSuchElementException if id is not a valid id.

    Definition Classes
    ConcurrentHashMapDynamicGraph → DirectedGraph

  22. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  23. def maxNodeId: Int

    The largest node id in this graph (or an upper bound on it).

    The largest node id in this graph (or an upper bound on it).

    Definition Classes
    ConcurrentHashMapDynamicGraph → DirectedGraph

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

    Definition Classes
    AnyRef

  25. def nodeCount: Int

    Returns the nodeCount if it is defined.

    Returns the nodeCount if it is defined. Otherwise throws an UnsupportedOperationException.

    Definition Classes
    DirectedGraph

  26. def nodeCountOption: Option[Int]

    The number of nodes in this graph.

    The number of nodes in this graph. May return None if it is expensive to compute (for example, for the union of two graphs).

    Definition Classes
    ConcurrentHashMapDynamicGraph → DirectedGraph

  27. def nodeIds: Iterable[Int]

    All nodeIds that exist in the graph.

    All nodeIds that exist in the graph.

    Definition Classes
    ConcurrentHashMapDynamicGraph → DirectedGraph

  28. val nodeMap: ConcurrentHashMap[Int, ConcurrentNode]

  29. final def notify(): Unit

    Definition Classes
    AnyRef

  30. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  31. def outDegree(id: Int): Int

    Returns the number of out-neighbors of the given id.

    Returns the number of out-neighbors of the given id.

    Definition Classes
    ConcurrentHashMapDynamicGraph → DirectedGraph

  32. def outDegreeOr0(id: Int): Int

    Returns the out-degree of the given node id, or 0 if the node id does not exist.

    Returns the out-degree of the given node id, or 0 if the node id does not exist.

    Definition Classes
    DirectedGraph

  33. def outNeighbor(id: Int, i: Int): Int

    Returns the ith out-neighbor of the node with the given id.

    Returns the ith out-neighbor of the node with the given id. Throws IndexOutOfBoundsException unless 0 <= i < outDegree(id).

    Definition Classes
    DirectedGraph

  34. def outNeighborList(id: Int): List[Integer]

    Returns the out-neighbors of the given id as a java.util.List.

    Returns the out-neighbors of the given id as a java.util.List.

    Definition Classes
    DirectedGraph

  35. def outNeighbors(id: Int): IndexedSeq[Int]

    Returns the out-neighbors of the given id.

    Returns the out-neighbors of the given id.

    Definition Classes
    ConcurrentHashMapDynamicGraph → DirectedGraph

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

    Definition Classes
    AnyRef

  37. def toString(): String

    Definition Classes
    DirectedGraph → AnyRef → Any

  38. def transposeView: DirectedGraph

    Returns a view of the transpose of this graph.

    Returns a view of the transpose of this graph.

    Definition Classes
    DirectedGraph

  39. def uniformRandomInNeighbor(id: Int, random: Random = Random.self): Int

    Definition Classes
    DirectedGraph

  40. def uniformRandomOutNeighbor(id: Int, random: Random = Random.self): Int

    Definition Classes
    DirectedGraph

  41. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Deprecated Value Members

  1. def getNodeById(id: Int): Option[NodeWrapper]

    Returns the node with the given id or else None if the given node does not exist in this graph.

    Returns the node with the given id or else None if the given node does not exist in this graph. Deprecated: to decrease the number of objects used, get node neighbors and degrees directly through the graph.

    Definition Classes
    DirectedGraph
    Annotations
    @deprecated
    Deprecated

    (Since version 1.0) Rather than using Node objects, use graph method directly

Inherited from DynamicDirectedGraph

Inherited from DirectedGraph

Inherited from AnyRef

Inherited from Any

Ungrouped