com.twitter.cassovary.graph

RandomTraverser

class RandomTraverser extends Traverser

Randomly traverse the graph, going from one node to a random neighbor in direction dir.

Self Type
RandomTraverser
Linear Supertypes
Traverser, Iterator[Node], TraversableOnce[Node], GenTraversableOnce[Node], AnyRef, Any
Known Subclasses
RandomBoundedTraverser
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. RandomTraverser
  2. Traverser
  3. Iterator
  4. TraversableOnce
  5. GenTraversableOnce
  6. AnyRef
  7. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new RandomTraverser(graph: Graph, dir: GraphDir, homeNodeIds: Seq[Int], resetProbability: Double, maxNumEdgesThresh: Option[Int], onlyOnce: Boolean, randNumGen: Random, maxDepth: Option[Int], filterHomeNodeByNumEdges: Boolean)

    graph

    the graph to traverse on

    dir

    direction in which to traverse

    homeNodeIds

    the ids of nodes that the traverser will go to next if the node has no neighbors, or we reset the traversal with probability resetProbability, or if the number of out-going edges at the current node exceeds maxNumEdgesThresh

    resetProbability

    the probability of teleporting back to home node set at each step

    maxNumEdgesThresh

    if set, do not traverse edges with > maxNumEdgesThresh outgoing edges

    onlyOnce

    specifies whether the same node should only be allowed to be visited once in any path.

    randNumGen

    a random number generator (for stable walk, a seeded random number generator is used).

    maxDepth

    if set, max depth of path

    filterHomeNodeByNumEdges

    filter home node by number of edges

Type Members

  1. class GroupedIterator[B >: A] extends AbstractIterator[Seq[B]] with Iterator[Seq[B]]

    Definition Classes
    Iterator

Value Members

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. def ++[B >: Node](that: ⇒ GenTraversableOnce[B]): Iterator[B]

    Definition Classes
    Iterator

  5. def /:[B](z: B)(op: (B, Node) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  6. def :\[B](z: B)(op: (Node, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  9. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce

  10. def addString(b: StringBuilder, sep: String): StringBuilder

    Definition Classes
    TraversableOnce

  11. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Definition Classes
    TraversableOnce

  12. def aggregate[B](z: B)(seqop: (B, Node) ⇒ B, combop: (B, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  13. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  14. def buffered: BufferedIterator[Node]

    Definition Classes
    Iterator

  15. def clone(): AnyRef

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

  16. def collect[B](pf: PartialFunction[Node, B]): Iterator[B]

    Definition Classes
    Iterator
    Annotations
    @migration
    Migration

    (Changed in version 2.8.0) collect has changed. The previous behavior can be reproduced with toSeq.

  17. def collectFirst[B](pf: PartialFunction[Node, B]): Option[B]

    Definition Classes
    TraversableOnce

  18. def contains(elem: Any): Boolean

    Definition Classes
    Iterator

  19. def copyToArray[B >: Node](xs: Array[B], start: Int, len: Int): Unit

    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce

  20. def copyToArray[B >: Node](xs: Array[B]): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce

  21. def copyToArray[B >: Node](xs: Array[B], start: Int): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce

  22. def copyToBuffer[B >: Node](dest: Buffer[B]): Unit

    Definition Classes
    TraversableOnce

  23. def corresponds[B](that: GenTraversableOnce[B])(p: (Node, B) ⇒ Boolean): Boolean

    Definition Classes
    Iterator

  24. def count(p: (Node) ⇒ Boolean): Int

    Definition Classes
    TraversableOnce → GenTraversableOnce

  25. def drop(n: Int): Iterator[Node]

    Definition Classes
    Iterator

  26. def dropWhile(p: (Node) ⇒ Boolean): Iterator[Node]

    Definition Classes
    Iterator

  27. def duplicate: (Iterator[Node], Iterator[Node])

    Definition Classes
    Iterator

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

    Definition Classes
    AnyRef

  29. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  30. def exists(p: (Node) ⇒ Boolean): Boolean

    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce

  31. def filter(p: (Node) ⇒ Boolean): Iterator[Node]

    Definition Classes
    Iterator

  32. def filterNot(p: (Node) ⇒ Boolean): Iterator[Node]

    Definition Classes
    Iterator

  33. def finalize(): Unit

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

  34. def find(p: (Node) ⇒ Boolean): Option[Node]

    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce

  35. def flatMap[B](f: (Node) ⇒ GenTraversableOnce[B]): Iterator[B]

    Definition Classes
    Iterator

  36. def fold[A1 >: Node](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

  37. def foldLeft[B](z: B)(op: (B, Node) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  38. def foldRight[B](z: B)(op: (Node, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  39. def forall(p: (Node) ⇒ Boolean): Boolean

    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce

  40. def foreach[U](f: (Node) ⇒ U): Unit

    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef → Any

  42. def getExistingNodeById(graph: Graph, id: Int): Node

    Traverser only visits node Ids listed in some node's edges, and thus we know that node must exist, safe to assume graph.

    Traverser only visits node Ids listed in some node's edges, and thus we know that node must exist, safe to assume graph.getNodeById return non-None value

    Attributes
    protected
    Definition Classes
    Traverser

  43. def grouped[B >: Node](size: Int): GroupedIterator[B]

    Definition Classes
    Iterator

  44. def hasDefiniteSize: Boolean

    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce

  45. def hasNext: Boolean

    Definition Classes
    RandomTraverser → Iterator

  46. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  47. def indexOf[B >: Node](elem: B): Int

    Definition Classes
    Iterator

  48. def indexWhere(p: (Node) ⇒ Boolean): Int

    Definition Classes
    Iterator

  49. def isEmpty: Boolean

    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce

  50. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  51. def isTraversableAgain: Boolean

    Definition Classes
    Iterator → GenTraversableOnce

  52. def length: Int

    Definition Classes
    Iterator

  53. def map[B](f: (Node) ⇒ B): Iterator[B]

    Definition Classes
    Iterator

  54. def max[B >: Node](implicit cmp: Ordering[B]): Node

    Definition Classes
    TraversableOnce → GenTraversableOnce

  55. def maxBy[B](f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node

    Definition Classes
    TraversableOnce → GenTraversableOnce

  56. def min[B >: Node](implicit cmp: Ordering[B]): Node

    Definition Classes
    TraversableOnce → GenTraversableOnce

  57. def minBy[B](f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node

    Definition Classes
    TraversableOnce → GenTraversableOnce

  58. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  59. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  60. def mkString(start: String, sep: String, end: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

  62. def next(): Node

    Definition Classes
    RandomTraverser → Iterator

  63. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce

  64. final def notify(): Unit

    Definition Classes
    AnyRef

  65. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  66. def padTo[A1 >: Node](len: Int, elem: A1): Iterator[A1]

    Definition Classes
    Iterator

  67. def partition(p: (Node) ⇒ Boolean): (Iterator[Node], Iterator[Node])

    Definition Classes
    Iterator

  68. def patch[B >: Node](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]

    Definition Classes
    Iterator

  69. def product[B >: Node](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  70. def reduce[A1 >: Node](op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

  71. def reduceLeft[B >: Node](op: (B, Node) ⇒ B): B

    Definition Classes
    TraversableOnce

  72. def reduceLeftOption[B >: Node](op: (B, Node) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  73. def reduceOption[A1 >: Node](op: (A1, A1) ⇒ A1): Option[A1]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  74. def reduceRight[B >: Node](op: (Node, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  75. def reduceRightOption[B >: Node](op: (Node, B) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  76. def reversed: List[Node]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

  77. def sameElements(that: Iterator[_]): Boolean

    Definition Classes
    Iterator

  78. def scanLeft[B](z: B)(op: (B, Node) ⇒ B): Iterator[B]

    Definition Classes
    Iterator

  79. def scanRight[B](z: B)(op: (Node, B) ⇒ B): Iterator[B]

    Definition Classes
    Iterator

  80. def seenBefore(id: Int): Boolean

    Attributes
    protected

  81. def seq: Iterator[Node]

    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce

  82. def size: Int

    Definition Classes
    TraversableOnce → GenTraversableOnce

  83. def slice(from: Int, until: Int): Iterator[Node]

    Definition Classes
    Iterator

  84. def sliding[B >: Node](size: Int, step: Int): GroupedIterator[B]

    Definition Classes
    Iterator

  85. def span(p: (Node) ⇒ Boolean): (Iterator[Node], Iterator[Node])

    Definition Classes
    Iterator

  86. def sum[B >: Node](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

  88. def take(n: Int): Iterator[Node]

    Definition Classes
    Iterator

  89. def takeWhile(p: (Node) ⇒ Boolean): Iterator[Node]

    Definition Classes
    Iterator

  90. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Node, Col[Node]]): Col[Node]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  91. def toArray[B >: Node](implicit arg0: ClassTag[B]): Array[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  92. def toBuffer[B >: Node]: Buffer[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  93. def toIndexedSeq: IndexedSeq[Node]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  94. def toIterable: Iterable[Node]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  95. def toIterator: Iterator[Node]

    Definition Classes
    Iterator → GenTraversableOnce

  96. def toList: List[Node]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  97. def toMap[T, U](implicit ev: <:<[Node, (T, U)]): Map[T, U]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  98. def toSeq: Seq[Node]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  99. def toSet[B >: Node]: Set[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  100. def toStream: Stream[Node]

    Definition Classes
    Iterator → GenTraversableOnce

  101. def toString(): String

    Definition Classes
    Iterator → AnyRef → Any

  102. def toTraversable: Traversable[Node]

    Definition Classes
    Iterator → TraversableOnce → GenTraversableOnce

  103. def toVector: Vector[Node]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  104. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  107. def withFilter(p: (Node) ⇒ Boolean): Iterator[Node]

    Definition Classes
    Iterator

  108. def zip[B](that: Iterator[B]): Iterator[(Node, B)]

    Definition Classes
    Iterator

  109. def zipAll[B, A1 >: Node, B1 >: B](that: Iterator[B], thisElem: A1, thatElem: B1): Iterator[(A1, B1)]

    Definition Classes
    Iterator

  110. def zipWithIndex: Iterator[(Node, Int)]

    Definition Classes
    Iterator

Deprecated Value Members

  1. def /:\[A1 >: Node](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

Inherited from Traverser

Inherited from Iterator[Node]

Inherited from TraversableOnce[Node]

Inherited from GenTraversableOnce[Node]

Inherited from AnyRef

Inherited from Any

Ungrouped