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 isBiDirectional: Boolean

    

    Definition Classes

    DirectedGraph

55. 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

56. def isEmpty: Boolean

    

    Definition Classes

    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

57. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

58. final def isTraversableAgain: Boolean

    

    Definition Classes

    TraversableLike → GenTraversableLike → GenTraversableOnce

59. def iterator: Iterator[Node]

    

    Definition Classes

    TestGraph → IterableLike → GenIterableLike

60. 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

61. def last: Node

    

    Definition Classes

    TraversableLike → GenTraversableLike

62. def lastOption: Option[Node]

    

    Definition Classes

    TraversableLike → GenTraversableLike

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

    

    Definition Classes

    TraversableLike → GenTraversableLike → FilterMonadic

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

66. lazy val maxNodeId: Int

    

    the max node id

    the max node id

    Definition Classes

    DirectedGraph

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

69. def mkString: String

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

70. def mkString(sep: String): String

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    AnyRef

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

    

    Attributes

    protected[this]

    Definition Classes

    GenericTraversableTemplate → HasNewBuilder

74. def nodeCount: Int

    

    Returns the number of nodes in the graph.

    Returns the number of nodes in the graph.

    Definition Classes

    TestGraph → DirectedGraph

75. var nodeLabels: Labels[Int]

    

    Labels on nodes of this graph.

    Labels on nodes of this graph.

    Definition Classes

    DirectedGraph

76. val nodeTable: HashMap[Int, Node]

    

77. val nodes: Node*

    

78. def nonEmpty: Boolean

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

79. final def notify(): Unit

    

    Definition Classes

    AnyRef

80. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

81. def par: ParIterable[Node]

    

    Definition Classes

    Parallelizable

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

    

    Attributes

    protected[this]

    Definition Classes

    TraversableLike → Parallelizable

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

    

    Definition Classes

    TraversableLike → GenTraversableLike

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    IterableLike → TraversableOnce → GenTraversableOnce

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

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

91. def removeNode(node: Node): Unit

    

92. def repr: Iterable[Node]

    

    Definition Classes

    TraversableLike → GenTraversableLike

93. def reversed: List[Node]

    

    Attributes

    protected[this]

    Definition Classes

    TraversableOnce

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

    

    Definition Classes

    IterableLike → GenIterableLike

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

    

    Definition Classes

    TraversableLike → GenTraversableLike

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

    

    Definition Classes

    TraversableLike → GenTraversableLike

97. 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.

98. def seq: Iterable[Node]

    

    Definition Classes

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

99. def size: Int

    

    Definition Classes

    TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableLike

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

     

     Definition Classes

     IterableLike

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

     

     Definition Classes

     IterableLike

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

     

     Definition Classes

     TraversableLike → GenTraversableLike

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

     

     Definition Classes

     TraversableLike → GenTraversableLike

105. 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

106. def stringPrefix: String

     

     Definition Classes

     TraversableLike → GenTraversableLike

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     AnyRef

109. def tail: Iterable[Node]

     

     Definition Classes

     TraversableLike → GenTraversableLike

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

     

     Definition Classes

     TraversableLike

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

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableLike

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

     

     Definition Classes

     IterableLike

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

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableLike

114. def thisCollection: Iterable[Node]

     

     Attributes

     protected[this]

     Definition Classes

     IterableLike → TraversableLike

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

     

     Definition Classes

     TraversableLike → TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

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

     

     Attributes

     protected[this]

     Definition Classes

     IterableLike → TraversableLike

119. def toIndexedSeq: IndexedSeq[Node]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

120. def toIterable: Iterable[Node]

     

     Definition Classes

     IterableLike → TraversableOnce → GenTraversableOnce

121. def toIterator: Iterator[Node]

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableOnce

     Annotations

     @deprecatedOverriding( ... , "2.11.0" )

122. def toList: List[Node]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

124. def toSeq: Seq[Node]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

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

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

126. def toStream: Stream[Node]

     

     Definition Classes

     IterableLike → TraversableLike → GenTraversableOnce

127. def toString(numNodes: Int): String

     

     Definition Classes

     DirectedGraph

128. 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

129. def toTraversable: Traversable[Node]

     

     Definition Classes

     TraversableLike → TraversableOnce → GenTraversableOnce

     Annotations

     @deprecatedOverriding( ... , "2.11.0" )

130. def toVector: Vector[Node]

     

     Definition Classes

     TraversableOnce → GenTraversableOnce

131. 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.

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

     

     Definition Classes

     GenericTraversableTemplate

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

     

     Definition Classes

     GenericTraversableTemplate

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

     

     Definition Classes

     IterableLike → TraversableLike

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

     

     Definition Classes

     IterableLike → TraversableLike

136. final def wait(): Unit

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

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

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

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

     

     Definition Classes

     AnyRef

     Annotations

     @throws( ... )

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

     

     Definition Classes

     TraversableLike → FilterMonadic

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

     

     Definition Classes

     IterableLike → GenIterableLike

141. 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

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

     

     Definition Classes

     IterableLike → GenIterableLike