DynamicNode

abstract def addInBoundNodes(nodeIds: Seq[Int]): Unit

Add inbound edges nodeIds into the inbound list.

abstract def addOutBoundNodes(nodeIds: Seq[Int]): Unit

Add outbound edges nodeId into the outbound list

abstract val id: Int

The unique id of this node.

abstract def inboundNodes(): Seq[Int]

Returns ids of all nodes pointing to this node.

abstract def outboundNodes(): Seq[Int]

abstract def removeInBoundNode(nodeId: Int): Unit

Remove a single edge nodeId from the inbound list.

abstract def removeOutBoundNode(nodeId: Int): Unit

Remove a single edge nodeId from the outbound list.

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def addInBoundNode(nodeId: Int): Unit

Add single inbound edge nodeId into the inbound list

def addOutBoundNode(nodeId: Int): Unit

Add single outbound edge nodeId into the outbound list

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def containsNode(nodeIds: Seq[Int], queryNodeId: Int): Boolean

The default implementation just walks the array but users likely want to override to provide a more optimized implementation.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def inboundCount: Int

def inboundNodes(max: Int): Seq[Int]

Returns up to max nodes that this node points to.

def isInboundNode(nodeId: Int): Boolean

Returns true if the given nodeId points to this node.

final def isInstanceOf[T0]: Boolean

def isNeighbor(dir: GraphDir, nodeId: Int): Boolean

whether nodeId is a neighbor in the allowing direction dir

def isOutboundNode(nodeId: Int): Boolean

Returns true if the this node point to the given node.

final def ne(arg0: AnyRef): Boolean

def neighborCount(dir: GraphDir): Int

the neighbor count in the allowing direction dir

def neighborIds(dir: GraphDir, max: Int): Seq[Int]

A method that returns max nodes of either inbound or outbound allowing direction dir.

def neighborIds(dir: GraphDir): Seq[Int]

A method that return either inbound or outbound allowing direction dir.

final def notify(): Unit

final def notifyAll(): Unit

def outboundCount: Int

def outboundNodes(max: Int): Seq[Int]

def randomInboundNode(rnd: Random): Option[Int]

Returns a random node from the set of nodes that points to this node or else None if this node has no inbound edges, using the supplied random number generator rnd.

def randomInboundNode: Option[Int]

Returns a random node from the set of nodes that points to this node or else None if this node has no inbound edges.

def randomInboundNodeSet(numResults: Int, rnd: Random): Seq[Int]

Returns a random sample of size at most numResults from the set of nodes that point to this node using the supplied random number generator rnd.

def randomNeighbor(dir: GraphDir, rnd: Random): Option[Int]

A method that returns a random node in the allowing direction dir, using the supplied random number generator rnd.

def randomNeighbor(dir: GraphDir): Option[Int]

A method that returns a random node in the allowing direction dir.

def randomNeighborSet(numResults: Int, dir: GraphDir, rnd: Random): Seq[Int]

A method that returns a set of either inbound or outbound nodes of size numResults, in the allowing direction dir, using the supplied random number generator rnd.

def randomNeighborSet(numResults: Int, dir: GraphDir): Seq[Int]

A method that returns a random node of size numResults in the allowing direction dir, using the supplied random number generator rnd.

def randomNode(nodeIds: Seq[Int], rnd: Random): Option[Int]

def randomNodeSet(nodeIds: Seq[Int], numResults: Int, rnd: Random): Array[Int]

Random sampling with replacement.

def randomOutboundNode(rnd: Random): Option[Int]

Returns a random node from the set of nodes that this node points to or else None if this node has no outbound edges, using the supplied random number generator rnd.

def randomOutboundNode: Option[Int]

Returns a random node from the set of nodes that this node points to or else None if this node has no outbound edges.

def randomOutboundNodeSet(numResults: Int, rnd: Random): Seq[Int]

Returns a random sample of size at most numResults from the set of nodes that this node points to using the supplied random number generator rnd.

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

def toString(): String

Override toString to make debugging easier.

final def wait(): Unit

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

final def wait(arg0: Long): Unit