DynamicDirectedGraph

abstract def addEdge(id1: Int, id2: Int): Unit

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

abstract def edgeCount: Long

The number of edges in this graph.

abstract def existsNode(id: Int): Boolean

abstract def inDegree(id: Int): Int

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

abstract def inNeighbors(id: Int): IndexedSeq[Int]

Returns the in-neighbors of the given id.

abstract def maxNodeId: Int

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

abstract def nodeCountOption: Option[Int]

The number of nodes in this graph.

abstract def nodeIds: Iterable[Int]

All nodeIds that exist in the graph.

abstract def outDegree(id: Int): Int

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

abstract def outNeighbors(id: Int): IndexedSeq[Int]

Returns the out-neighbors of the given id.

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

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

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

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def inDegreeOr0(id: Int): Int

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

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

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

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

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

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

def nodeCount: Int

Returns the nodeCount if it is defined.

final def notify(): Unit

final def notifyAll(): Unit

def outDegreeOr0(id: Int): Int

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

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

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

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

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

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

def toString(): String

def transposeView: DirectedGraph

Returns a view of the transpose of this graph.

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

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

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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.