TestGraph

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. def ++[B >: Node, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[Node], B, That]): That

   

   Definition Classes

   TraversableLike → GenTraversableLike

4. def ++:[B >: Node, That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[Node], B, That]): That

   

   Definition Classes

   TraversableLike

5. def ++:[B >: Node, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[Node], B, That]): That

   

   Definition Classes

   TraversableLike

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

   

   Definition Classes

   TraversableOnce → GenTraversableOnce

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

   

   Definition Classes

   TraversableOnce → GenTraversableOnce

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

   

   Definition Classes

   AnyRef → Any

9. def addNode(node: Node): Unit

   

10. def addString(b: StringBuilder): StringBuilder

    

    Definition Classes

    TraversableOnce

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

    

    Definition Classes

    TraversableOnce

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

    

    Definition Classes

    TraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

14. def approxStorageComplexity(): Long

    

    Definition Classes

    DirectedGraph

15. final def asInstanceOf[T0]: T0

    

    Definition Classes

    Any

16. def canEqual(that: Any): Boolean

    

    Definition Classes

    IterableLike → Equals

17. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

18. def collect[B, That](pf: PartialFunction[Node, B])(implicit bf: CanBuildFrom[Iterable[Node], B, That]): That

    

    Definition Classes

    TraversableLike → GenTraversableLike

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

    

    Definition Classes

    TraversableOnce

20. def companion: GenericCompanion[Iterable]

    

    Definition Classes

    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate

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

    

    Definition Classes

    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

26. def drop(n: Int): Iterable[Node]

    

    Definition Classes

    IterableLike → TraversableLike → GenTraversableLike

27. def dropRight(n: Int): Iterable[Node]

    

    Definition Classes

    IterableLike

28. def dropWhile(p: (Node) ⇒ Boolean): Iterable[Node]

    

    Definition Classes

    TraversableLike → GenTraversableLike

29. def edgeCount: Long

    

    Returns the total number of directed edges in the graph.

    Returns the total number of directed edges in the graph. A mutual edge, eg: A -> B and B -> A, counts as 2 edges in this total.

    Definition Classes

    TestGraph → DirectedGraph

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

    

    Definition Classes

    AnyRef

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

    

    Definition Classes

    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

32. def existsNodeId(id: Int): Boolean

    

    Definition Classes

    Graph

33. def filter(p: (Node) ⇒ Boolean): Iterable[Node]

    

    Definition Classes

    TraversableLike → GenTraversableLike

34. def filterNot(p: (Node) ⇒ Boolean): Iterable[Node]

    

    Definition Classes

    TraversableLike → GenTraversableLike

35. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

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

    

    Definition Classes

    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

37. def flatMap[B, That](f: (Node) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[Node], B, That]): That

    

    Definition Classes

    TraversableLike → GenTraversableLike → FilterMonadic

38. def flatten[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): Iterable[B]

    

    Definition Classes

    GenericTraversableTemplate

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    IterableLike → TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

44. def genericBuilder[B]: Builder[B, Iterable[B]]

    

    Definition Classes

    GenericTraversableTemplate

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

    

    Definition Classes

    AnyRef → Any

46. def getNodeById(id: Int): Option[Node]

    

    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.

    Definition Classes

    TestGraph → Graph

47. def groupBy[K](f: (Node) ⇒ K): Map[K, Iterable[Node]]

    

    Definition Classes

    TraversableLike → GenTraversableLike

48. def grouped(size: Int): Iterator[Iterable[Node]]

    

    Definition Classes

    IterableLike

49. def hasDefiniteSize: Boolean

    

    Definition Classes

    TraversableLike → TraversableOnce → GenTraversableOnce

50. def head: Node

    

    Definition Classes

    IterableLike → TraversableLike → GenTraversableLike

51. def headOption: Option[Node]

    

    Definition Classes

    TraversableLike → GenTraversableLike

52. def init: Iterable[Node]

    

    Definition Classes

    TraversableLike → GenTraversableLike

53. def inits: Iterator[Iterable[Node]]

    

    Definition Classes

    TraversableLike

54. def isDirStored(dir: GraphDir): Boolean

    

    Checks if the given graph dir is stored in this graph

    Checks if the given graph dir is stored in this graph

    dir

    the graph dir in question

    returns

    if the current graph stores the query graph direction

    Definition Classes

    DirectedGraph

55. def isEmpty: Boolean

    

    Definition Classes

    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

56. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

57. final def isTraversableAgain: Boolean

    

    Definition Classes

    TraversableLike → GenTraversableLike → GenTraversableOnce

58. def iterator: Iterator[Node]

    

    Definition Classes

    TestGraph → IterableLike → GenIterableLike

59. def labelOfNode[L](nodeId: Int, labelName: String)(implicit arg0: scala.reflect.api.JavaUniverse.TypeTag[L]): Option[L]

    

    The label of a node accessed by name.

    The label of a node accessed by name. Label can be anything.

    Definition Classes

    DirectedGraph

60. def last: Node

    

    Definition Classes

    TraversableLike → GenTraversableLike

61. def lastOption: Option[Node]

    

    Definition Classes

    TraversableLike → GenTraversableLike

62. def map[B, That](f: (Node) ⇒ B)(implicit bf: CanBuildFrom[Iterable[Node], B, That]): That

    

    Definition Classes

    TraversableLike → GenTraversableLike → FilterMonadic

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

65. lazy val maxNodeId: Int

    

    the max node id

    the max node id

    Definition Classes

    DirectedGraph

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

68. def mkString: String

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

69. def mkString(sep: String): String

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    AnyRef

72. def newBuilder: Builder[Node, Iterable[Node]]

    

    Attributes

    protected[this]

    Definition Classes

    GenericTraversableTemplate → HasNewBuilder

73. def nodeCount: Int

    

    Returns the number of nodes in the graph.

    Returns the number of nodes in the graph.

    Definition Classes

    TestGraph → DirectedGraph

74. var nodeLabels: Labels[Int]

    

    Labels on nodes of this graph.

    Labels on nodes of this graph.

    Definition Classes

    DirectedGraph

75. val nodeTable: HashMap[Int, Node]

    

76. val nodes: Node*

    

77. def nonEmpty: Boolean

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

78. final def notify(): Unit

    

    Definition Classes

    AnyRef

79. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

80. def par: ParIterable[Node]

    

    Definition Classes

    Parallelizable

81. def parCombiner: Combiner[Node, ParIterable[Node]]

    

    Attributes

    protected[this]

    Definition Classes

    TraversableLike → Parallelizable

82. def partition(p: (Node) ⇒ Boolean): (Iterable[Node], Iterable[Node])

    

    Definition Classes

    TraversableLike → GenTraversableLike

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    IterableLike → TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

90. def removeNode(node: Node): Unit

    

91. def repr: Iterable[Node]

    

    Definition Classes

    TraversableLike → GenTraversableLike

92. def reversed: List[Node]

    

    Attributes

    protected[this]

    Definition Classes

    TraversableOnce

93. def sameElements[B >: Node](that: GenIterable[B]): Boolean

    

    Definition Classes

    IterableLike → GenIterableLike

94. def scan[B >: Node, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[Node], B, That]): That

    

    Definition Classes

    TraversableLike → GenTraversableLike

95. def scanLeft[B, That](z: B)(op: (B, Node) ⇒ B)(implicit bf: CanBuildFrom[Iterable[Node], B, That]): That

    

    Definition Classes

    TraversableLike → GenTraversableLike

96. def scanRight[B, That](z: B)(op: (Node, B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[Node], B, That]): That

    

    Definition Classes

    TraversableLike → GenTraversableLike

    Annotations

    @migration

    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

97. def seq: Iterable[Node]

    

    Definition Classes

    Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

98. def size: Int

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

99. def slice(from: Int, until: Int): Iterable[Node]

    

    Definition Classes

    IterableLike → TraversableLike → GenTraversableLike

100. def sliding(size: Int, step: Int): Iterator[Iterable[Node]]

     

     Definition Classes

     IterableLike

101. def sliding(size: Int): Iterator[Iterable[Node]]

     

     Definition Classes

     IterableLike

102. def span(p: (Node) ⇒ Boolean): (Iterable[Node], Iterable[Node])

     

     Definition Classes

     TraversableLike → GenTraversableLike

103. def splitAt(n: Int): (Iterable[Node], Iterable[Node])

     

     Definition Classes

     TraversableLike → GenTraversableLike

104. val storedGraphDir: StoredGraphDir.Value

     

     Describes whether the stored graph is only in-directions, out-directions or both

     Describes whether the stored graph is only in-directions, out-directions or both

     Definition Classes

     TestGraph → DirectedGraph

105. def stringPrefix: String

     

     Definition Classes

     TraversableLike → GenTraversableLike

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     AnyRef

108. def tail: Iterable[Node]

     

     Definition Classes

     TraversableLike → GenTraversableLike

109. def tails: Iterator[Iterable[Node]]

     

     Definition Classes

     TraversableLike

110. def take(n: Int): Iterable[Node]

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableLike

111. def takeRight(n: Int): Iterable[Node]

     

     Definition Classes

     IterableLike

112. def takeWhile(p: (Node) ⇒ Boolean): Iterable[Node]

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableLike

113. def thisCollection: Iterable[Node]

     

     Attributes

     protected[this]

     Definition Classes

     IterableLike → TraversableLike

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

     

     Definition Classes

     TraversableLike → TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

117. def toCollection(repr: Iterable[Node]): Iterable[Node]

     

     Attributes

     protected[this]

     Definition Classes

     IterableLike → TraversableLike

118. def toIndexedSeq: IndexedSeq[Node]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

119. def toIterable: Iterable[Node]

     

     Definition Classes

     IterableLike → TraversableOnce → GenTraversableOnce

120. def toIterator: Iterator[Node]

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableOnce

     Annotations

     @deprecatedOverriding( ... , "2.11.0" )

121. def toList: List[Node]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

123. def toSeq: Seq[Node]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

125. def toStream: Stream[Node]

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableOnce

126. def toString(numNodes: Int): String

     

     Definition Classes

     DirectedGraph

127. def toString(): String

     

     Added default toString for debugging (prints max of 10 nodes)

     Added default toString for debugging (prints max of 10 nodes)

     Definition Classes

     DirectedGraph → TraversableLike → AnyRef → Any

128. def toTraversable: Traversable[Node]

     

     Definition Classes

     TraversableLike → TraversableOnce → GenTraversableOnce

     Annotations

     @deprecatedOverriding( ... , "2.11.0" )

129. def toVector: Vector[Node]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

130. def transpose[B](implicit asTraversable: (Node) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

     

     Definition Classes

     GenericTraversableTemplate

     Annotations

     @migration

     Migration

     (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

131. def unzip[A1, A2](implicit asPair: (Node) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

     

     Definition Classes

     GenericTraversableTemplate

132. def unzip3[A1, A2, A3](implicit asTriple: (Node) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

     

     Definition Classes

     GenericTraversableTemplate

133. def view(from: Int, until: Int): IterableView[Node, Iterable[Node]]

     

     Definition Classes

     IterableLike → TraversableLike

134. def view: IterableView[Node, Iterable[Node]]

     

     Definition Classes

     IterableLike → TraversableLike

135. final def wait(): Unit

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

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

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

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

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

138. def withFilter(p: (Node) ⇒ Boolean): FilterMonadic[Node, Iterable[Node]]

     

     Definition Classes

     TraversableLike → FilterMonadic

139. def zip[A1 >: Node, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[Node], (A1, B), That]): That

     

     Definition Classes

     IterableLike → GenIterableLike

140. def zipAll[B, A1 >: Node, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[Node], (A1, B), That]): That

     

     Definition Classes

     IterableLike → GenIterableLike

141. def zipWithIndex[A1 >: Node, That](implicit bf: CanBuildFrom[Iterable[Node], (A1, Int), That]): That

     

     Definition Classes

     IterableLike → GenIterableLike