Packages

trait InnerEdge extends Iterable[NodeT] with InnerEdgeParam[N, E, NodeT, E] with Edge with InnerElem

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. InnerEdge
  2. InnerElem
  3. Edge
  4. Serializable
  5. Serializable
  6. InnerEdgeParam
  7. EdgeParam
  8. OutParam
  9. Param
  10. Iterable
  11. IterableLike
  12. Equals
  13. GenIterable
  14. GenIterableLike
  15. Traversable
  16. GenTraversable
  17. GenericTraversableTemplate
  18. TraversableLike
  19. GenTraversableLike
  20. Parallelizable
  21. TraversableOnce
  22. GenTraversableOnce
  23. FilterMonadic
  24. HasNewBuilder
  25. AnyRef
  26. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by MonadOps
  4. by flattenTraversableOnce
  5. by EdgeAssoc
  6. by TraversableEnrichments
  7. by ChainingOps
  8. by toEdge
  9. by any2stringadd
  10. by StringFormat
  11. by Ensuring
  12. by ArrowAssoc
  13. by alternateImplicit
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type Self = Iterable[NodeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract def edge: E[NodeT]

    The outer edge after transformation by means of the copy method.

    The outer edge after transformation by means of the copy method. This edge contains references to inner nodes while the original outer edge contained references to outer nodes.

    Definition Classes
    InnerEdge → InnerEdgeParam
  2. abstract def iterator: Iterator[NodeT]
    Definition Classes
    IterableLike → GenIterableLike

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from InnerEdge to any2stringadd[InnerEdge] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ++[B >: NodeT, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  5. def ++:[B >: NodeT, That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That
    Definition Classes
    TraversableLike
  6. def ++:[B >: NodeT, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That
    Definition Classes
    TraversableLike
  7. def ->[B](y: B): (InnerEdge, B)
    Implicit
    This member is added by an implicit conversion from InnerEdge to ArrowAssoc[InnerEdge] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  8. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → 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 adjacents: Set[EdgeT]

    All connecting edges, that is all edges at any of the nodes incident with this edge.

    All connecting edges, that is all edges at any of the nodes incident with this edge.

    returns

    set of connecting edges including hooks.

  13. def aggregate[B](z: ⇒ B)(seqop: (B, NodeT) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  14. final def arity: Int

    Number of nodes linked by this Edge.

    Number of nodes linked by this Edge. At least two nodes are linked. In case of a hook, the two nodes are identical. Hyperedges may link more than two nodes.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  15. final def asEdgeT[N <: N, E[+X] <: EdgeLikeIn[X], G <: GraphBase[N, E]](g: G): GraphPredef.InnerEdgeParam.asEdgeT.G.EdgeT
    Attributes
    protected[collection]
    Definition Classes
    InnerEdgeParam
  16. final def asEdgeTProjection[N <: N, E[+X] <: EdgeLikeIn[X]]: EdgeT
    Attributes
    protected[collection]
    Definition Classes
    InnerEdgeParam
  17. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  18. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  19. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native() @HotSpotIntrinsicCandidate()
  20. def collect[B, That](pf: PartialFunction[NodeT, B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  21. def collectFirst[B](pf: PartialFunction[NodeT, B]): Option[B]
    Definition Classes
    TraversableOnce
  22. def companion: GenericCompanion[Iterable]
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  23. final def contains[M >: N](node: M): Boolean

    Same as isAt.

    Same as isAt.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
    Annotations
    @inline()
  24. def copyToArray[B >: NodeT](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  25. def copyToArray[B >: NodeT](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  26. def copyToArray[B >: NodeT](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  27. def copyToBuffer[B >: NodeT](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  28. def count(p: (NodeT) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  29. def directed: Boolean

    true if this edge is directed.

    true if this edge is directed.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  30. def drop(n: Int): Iterable[NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  31. def dropRight(n: Int): Iterable[NodeT]
    Definition Classes
    IterableLike
  32. def dropWhile(p: (NodeT) ⇒ Boolean): Iterable[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  33. def ensuring(cond: (InnerEdge) ⇒ Boolean, msg: ⇒ Any): InnerEdge
    Implicit
    This member is added by an implicit conversion from InnerEdge to Ensuring[InnerEdge] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  34. def ensuring(cond: (InnerEdge) ⇒ Boolean): InnerEdge
    Implicit
    This member is added by an implicit conversion from InnerEdge to Ensuring[InnerEdge] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  35. def ensuring(cond: Boolean, msg: ⇒ Any): InnerEdge
    Implicit
    This member is added by an implicit conversion from InnerEdge to Ensuring[InnerEdge] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  36. def ensuring(cond: Boolean): InnerEdge
    Implicit
    This member is added by an implicit conversion from InnerEdge to Ensuring[InnerEdge] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  37. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  38. def equals(other: Any): Boolean
    Definition Classes
    InnerEdge → Equals → AnyRef → Any
  39. def exists(p: (NodeT) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  40. def filter(p: (NodeT) ⇒ Boolean): Iterable[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  41. def filterNot(p: (NodeT) ⇒ Boolean): Iterable[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  42. def find(p: (NodeT) ⇒ Boolean): Option[NodeT]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  43. def flatMap[B, That](f: (NodeT) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  44. def flatten[B](implicit asTraversable: (NodeT) ⇒ GenTraversableOnce[B]): Iterable[B]
    Definition Classes
    GenericTraversableTemplate
  45. final def fold[N <: N, E[+X] <: EdgeLikeIn[X], G <: GraphBase[N, E], T](g: G)(fa: (GraphPredef.InnerEdgeParam.fold.G.EdgeT) ⇒ T, fb: (EdgeT) ⇒ T): T
    Definition Classes
    InnerEdgeParam
  46. def fold[A1 >: NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  47. def foldLeft[B](z: B)(op: (B, NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  48. def foldRight[B](z: B)(op: (NodeT, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  49. def forall(p: (NodeT) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  50. def foreach[U](f: (NodeT) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  51. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from InnerEdge to StringFormat[InnerEdge] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  52. def genericBuilder[B]: Builder[B, Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
  53. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  54. def groupBy[K](f: (NodeT) ⇒ K): Map[K, Iterable[NodeT]]
    Definition Classes
    TraversableLike → GenTraversableLike
  55. def grouped(size: Int): Iterator[Iterable[NodeT]]
    Definition Classes
    IterableLike
  56. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  57. def hasSource(pred: (NodeT) ⇒ Boolean): Boolean

    true if any source end of this edge fulfills pred.

    true if any source end of this edge fulfills pred.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  58. def hasSource[M >: N](node: M): Boolean

    true if node is a source of this edge.

    true if node is a source of this edge. In case this edge is undirected this method maps to isAt.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  59. def hasTarget(pred: (NodeT) ⇒ Boolean): Boolean

    true if any target end of this edge fulfills pred.

    true if any target end of this edge fulfills pred.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  60. def hasTarget[M >: N](node: M): Boolean

    true if node is a target of this edge.

    true if node is a target of this edge. In case this edge is undirected this method maps to isAt.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  61. def hashCode(): Int
    Definition Classes
    InnerEdge → AnyRef → Any
  62. def head: NodeT
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  63. def headOption: Option[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  64. def init: Iterable[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  65. def inits: Iterator[Iterable[NodeT]]
    Definition Classes
    TraversableLike
  66. def isAt(pred: (NodeT) ⇒ Boolean): Boolean

    true if any end of this edge fulfills pred.

    true if any end of this edge fulfills pred.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  67. def isAt[M >: N](node: M): Boolean

    true if node is incident with this edge.

    true if node is incident with this edge.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  68. final def isContaining[N <: N, E[+X] <: EdgeLikeIn[X]](g: GraphBase[N, E]): Boolean
    Definition Classes
    InnerEdgeParam
  69. def isDefined: Boolean
    Definition Classes
    Param
  70. final def isDirected: Boolean

    Same as directed.

    Same as directed.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
    Annotations
    @inline()
  71. final def isEdge: Boolean
    Definition Classes
    Param
  72. def isEmpty: Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  73. def isHyperEdge: Boolean

    true if this is a hyperedge that is it may have more than two ends.

    true if this is a hyperedge that is it may have more than two ends.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  74. def isIn: Boolean
    Definition Classes
    OutParam → Param
  75. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  76. def isLabeled: Boolean

    true if this edge is labeled.

    true if this edge is labeled. See also label.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  77. def isLooping: Boolean

    true if this edge produces a self-loop.

    true if this edge produces a self-loop. In case of a non-hyperedge, a loop is given if the incident nodes are equal. In case of a directed hyperedge, a loop is given if the source is equal to any of the targets. In case of an undirected hyperedge, a loop is given if any pair of incident nodes has equal nodes.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  78. def isNode: Boolean
    Definition Classes
    EdgeParam
  79. final def isOut: Boolean
    Definition Classes
    Param
  80. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  81. final def isUndirected: Boolean

    Same as undirected.

    Same as undirected.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
    Annotations
    @inline()
  82. def label: Any

    The label of this edge.

    The label of this edge. If Graph's edge type parameter has been inferred or set to a labeled edge type all contained edges are labeled. Otherwise you should assert, for instance by calling isLabeled, that the edge instance is labeled before calling this method.

    Note that label is normally not part of the edge key (hashCode). As a result, edges with different labels connecting the same nodes will be evaluated as equal and thus added once and only once to the graph. In case you need multi-edges based on different labels you should either make use of a predefined key-labeled edge type such as LDiEdge or define a custom edge class that mixes in ExtendedKey and adds label to keyAttributes.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
    Exceptions thrown

    UnsupportedOperationException if the edge is non-labeled.

  83. def last: NodeT
    Definition Classes
    TraversableLike → GenTraversableLike
  84. def lastOption: Option[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  85. def map[B, That](f: (NodeT) ⇒ B)(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  86. def matches(p1: (NodeT) ⇒ Boolean, p2: (NodeT) ⇒ Boolean): Boolean

    true if
    a) two distinct ends of this undirected edge exist for which p1 and p2 hold or
    b) p1 holds for a source and p2 for a target of this directed edge.

    true if
    a) two distinct ends of this undirected edge exist for which p1 and p2 hold or
    b) p1 holds for a source and p2 for a target of this directed edge.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  87. def matches[M >: N](n1: M, n2: M): Boolean

    true if
    a) both n1 and n2 are at this edge for an undirected edge
    b) n1 is a source and n2 a target of this edge for a directed edge.

    true if
    a) both n1 and n2 are at this edge for an undirected edge
    b) n1 is a source and n2 a target of this edge for a directed edge.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  88. def max[B >: NodeT](implicit cmp: Ordering[B]): NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. def maxBy[B](f: (NodeT) ⇒ B)(implicit cmp: Ordering[B]): NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def min[B >: NodeT](implicit cmp: Ordering[B]): NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. def minBy[B](f: (NodeT) ⇒ B)(implicit cmp: Ordering[B]): NodeT
    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  93. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. val n1: InnerEdge
    Implicit
    This member is added by an implicit conversion from InnerEdge to EdgeAssoc[InnerEdge] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  96. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  97. def newBuilder: Builder[NodeT, Iterable[NodeT]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  98. def nodeSeq: Seq[NodeT]

    Sequence of the end points of this edge.

    Sequence of the end points of this edge.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  99. final def nodes: Iterable[NodeT]

    The inner nodes incident with this inner edge.

    The inner nodes incident with this inner edge. This is just a synonym to this that extends Iterable[NodeT].

    Annotations
    @inline()
  100. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  101. final def nonHyperEdge: Boolean

    true if this edge has exactly two ends.

    true if this edge has exactly two ends.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
    Annotations
    @inline()
  102. final def nonLooping: Boolean

    Same as ! looping.

    Same as ! looping.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  103. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  104. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  105. def par: ParIterable[NodeT]
    Definition Classes
    Parallelizable
  106. def parCombiner: Combiner[NodeT, ParIterable[NodeT]]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  107. def partition(p: (NodeT) ⇒ Boolean): (Iterable[NodeT], Iterable[NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  108. def pipe[B](f: (InnerEdge) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from InnerEdge to ChainingOps[InnerEdge] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  109. def privateNodes: Set[NodeT]

    Finds nodes of this edge which only participate in this edge.

    Finds nodes of this edge which only participate in this edge.

    returns

    those nodes of this edge which do not participate in any other edge

  110. def product[B >: NodeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. def reduce[A1 >: NodeT](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  112. def reduceLeft[B >: NodeT](op: (B, NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce
  113. def reduceLeftOption[B >: NodeT](op: (B, NodeT) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  114. def reduceOption[A1 >: NodeT](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def reduceRight[B >: NodeT](op: (NodeT, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  116. def reduceRightOption[B >: NodeT](op: (NodeT, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  117. def repr: Iterable[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  118. def reversed: List[NodeT]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  119. def sameElements[B >: NodeT](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  120. def scan[B >: NodeT, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  121. def scanLeft[B, That](z: B)(op: (B, NodeT) ⇒ B)(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  122. def scanRight[B, That](z: B)(op: (NodeT, B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[NodeT], 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.

  123. val self: InnerEdge
    Implicit
    This member is added by an implicit conversion from InnerEdge to ChainingOps[InnerEdge] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  124. def seq: Iterable[NodeT]
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  125. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  126. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  127. def slice(from: Int, until: Int): Iterable[NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  128. def sliding(size: Int, step: Int): Iterator[Iterable[NodeT]]
    Definition Classes
    IterableLike
  129. def sliding(size: Int): Iterator[Iterable[NodeT]]
    Definition Classes
    IterableLike
  130. def sources: Iterable[NodeT]

    All source ends of this edge.

    All source ends of this edge.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  131. def span(p: (NodeT) ⇒ Boolean): (Iterable[NodeT], Iterable[NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  132. def splitAt(n: Int): (Iterable[NodeT], Iterable[NodeT])
    Definition Classes
    TraversableLike → GenTraversableLike
  133. def stringPrefix: String
    Definition Classes
    InnerEdge → InnerEdgeParam → TraversableLike → GenTraversableLike
  134. def sum[B >: NodeT](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  135. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  136. val t: Iterable[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to TraversableEnrichments[NodeT, Iterable] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  137. def tail: Iterable[NodeT]
    Definition Classes
    TraversableLike → GenTraversableLike
  138. def tails: Iterator[Iterable[NodeT]]
    Definition Classes
    TraversableLike
  139. def take(n: Int): Iterable[NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  140. def takeRight(n: Int): Iterable[NodeT]
    Definition Classes
    IterableLike
  141. def takeWhile(p: (NodeT) ⇒ Boolean): Iterable[NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  142. def tap[U](f: (InnerEdge) ⇒ U): InnerEdge
    Implicit
    This member is added by an implicit conversion from InnerEdge to ChainingOps[InnerEdge] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  143. def targets: Iterable[NodeT]

    All target ends of this edge.

    All target ends of this edge.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  144. def thisCollection: Iterable[NodeT]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  145. def to: NodeT

    The head (target node) of a directed edge or _2 otherwise.

  146. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, NodeT, Col[NodeT]]): Col[NodeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  147. def toArray[B >: NodeT](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  148. def toBuffer[B >: NodeT]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  149. def toCollection(repr: Iterable[NodeT]): Iterable[NodeT]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  150. final def toEdgeT[N <: N, E[+X] <: EdgeLikeIn[X], G <: GraphBase[N, E]](g: G)(f: (EdgeT) ⇒ GraphPredef.InnerEdgeParam.toEdgeT.G.EdgeT): GraphPredef.InnerEdgeParam.toEdgeT.G.EdgeT
    Definition Classes
    InnerEdgeParam
  151. def toIndexedSeq: IndexedSeq[NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  152. def toIterable: Iterable[NodeT]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  153. def toIterator: Iterator[NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  154. def toList: List[NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  155. def toMap[T, U](implicit ev: <:<[NodeT, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  156. def toOuter: E[N]

    Reconstructs the outer edge by means of the copy method.

  157. def toOuterNodes[E[+X] <: EdgeLike[X]]: Seq[InParam[NodeT, E]]
    Implicit
    This member is added by an implicit conversion from InnerEdge to TraversableEnrichments[NodeT, Iterable] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  158. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from InnerEdge to CollectionsHaveToParArray[InnerEdge, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (InnerEdge) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  159. def toSeq: Seq[NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  160. def toSet[B >: NodeT]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  161. def toStream: Stream[NodeT]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  162. def toString(): String
    Definition Classes
    InnerEdge → InnerEdgeParam → TraversableLike → AnyRef → Any
  163. def toTraversable: Traversable[NodeT]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  164. def toVector: Vector[NodeT]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  165. def transpose[B](implicit asTraversable: (NodeT) ⇒ 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.

  166. final def undirected: Boolean

    true if this edge is undirected.

    true if this edge is undirected.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
    Annotations
    @inline()
  167. def unzip[A1, A2](implicit asPair: (NodeT) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    GenericTraversableTemplate
  168. def unzip3[A1, A2, A3](implicit asTriple: (NodeT) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    GenericTraversableTemplate
  169. val value: InnerEdge
    Implicit
    This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  170. def view(from: Int, until: Int): IterableView[NodeT, Iterable[NodeT]]
    Definition Classes
    IterableLike → TraversableLike
  171. def view: IterableView[NodeT, Iterable[NodeT]]
    Definition Classes
    IterableLike → TraversableLike
  172. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  173. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  174. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  175. def weight: Double

    The weight of this edge with a default of 1.

    The weight of this edge with a default of 1.

    Note that weight is normally not part of the edge key (hashCode). As a result, edges with different weights connecting the same nodes will be evaluated as equal and thus added once and only once to the graph. In case you need multi-edges based on different weights you should either make use of a predefined key-weighted edge type such as WDiEdge or define a custom edge class that mixes in ExtendedKey and adds weight to keyAttributes.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  176. def withFilter(p: (NodeT) ⇒ Boolean): FilterMonadic[NodeT, Iterable[NodeT]]
    Definition Classes
    TraversableLike → FilterMonadic
  177. def withSources[U](f: (NodeT) ⇒ U): Unit

    Applies f to all source ends of this edge without any memory allocation.

    Applies f to all source ends of this edge without any memory allocation.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  178. def withTargets[U](f: (NodeT) ⇒ U): Unit

    Applies f to the target ends of this edge without any memory allocation.

    Applies f to the target ends of this edge without any memory allocation.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  179. def zip[A1 >: NodeT, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[NodeT], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  180. def zipAll[B, A1 >: NodeT, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[NodeT], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  181. def zipWithIndex[A1 >: NodeT, That](implicit bf: CanBuildFrom[Iterable[NodeT], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  182. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from InnerEdge to EdgeAssoc[InnerEdge] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  183. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from InnerEdge to EdgeAssoc[InnerEdge] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  184. final def ~~: Set[EdgeT]

    Synonym for adjacents.

    Synonym for adjacents.

    Annotations
    @inline()
  185. def →[B](y: B): (InnerEdge, B)
    Implicit
    This member is added by an implicit conversion from InnerEdge to ArrowAssoc[InnerEdge] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def ++[B >: NodeT, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).++(that)(bf)
    Definition Classes
    TraversableLike → GenTraversableLike
  2. def ++:[B >: NodeT, That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).++:(that)(bf)
    Definition Classes
    TraversableLike
  3. def ++:[B >: NodeT, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).++:(that)(bf)
    Definition Classes
    TraversableLike
  4. def addString(b: StringBuilder): StringBuilder
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).addString(b)
    Definition Classes
    TraversableOnce
  5. def addString(b: StringBuilder, sep: String): StringBuilder
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).addString(b, sep)
    Definition Classes
    TraversableOnce
  6. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).addString(b, start, sep, end)
    Definition Classes
    TraversableOnce
  7. def aggregate[B](z: ⇒ B)(seqop: (B, NodeT) ⇒ B, combop: (B, B) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).aggregate(z)(seqop, combop)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  8. def canEqual(that: Any): Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).canEqual(that)
    Definition Classes
    EdgeLike → Eq → IterableLike → Equals
  9. def collect[B, That](pf: PartialFunction[NodeT, B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).collect(pf)(bf)
    Definition Classes
    TraversableLike → GenTraversableLike
  10. def collectFirst[B](pf: PartialFunction[NodeT, B]): Option[B]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).collectFirst(pf)
    Definition Classes
    TraversableOnce
  11. def companion: GenericCompanion[Iterable]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).companion
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  12. def copyToArray[B >: NodeT](xs: Array[B], start: Int, len: Int): Unit
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).copyToArray(xs, start, len)
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  13. def copyToArray[B >: NodeT](xs: Array[B]): Unit
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).copyToArray(xs)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  14. def copyToArray[B >: NodeT](xs: Array[B], start: Int): Unit
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).copyToArray(xs, start)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  15. def copyToBuffer[B >: NodeT](dest: Buffer[B]): Unit
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).copyToBuffer(dest)
    Definition Classes
    TraversableOnce
  16. def count(p: (NodeT) ⇒ Boolean): Int
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).count(p)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  17. def drop(n: Int): Iterable[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).drop(n)
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  18. def dropRight(n: Int): Iterable[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).dropRight(n)
    Definition Classes
    IterableLike
  19. def dropWhile(p: (NodeT) ⇒ Boolean): Iterable[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).dropWhile(p)
    Definition Classes
    TraversableLike → GenTraversableLike
  20. def edge: EdgeLike[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).edge
    Definition Classes
    OuterEdge
  21. def equals(other: Any): Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).equals(other)
    Definition Classes
    EdgeLike → Equals → AnyRef → Any
  22. def exists(p: (NodeT) ⇒ Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).exists(p)
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  23. def filter(p: (NodeT) ⇒ Boolean): TraversableOnce[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to MonadOps[NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: MonadOps[NodeT]).filter(p)
    Definition Classes
    MonadOps
  24. def filter(p: (NodeT) ⇒ Boolean): Iterable[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).filter(p)
    Definition Classes
    TraversableLike → GenTraversableLike
  25. def filterNot(p: (NodeT) ⇒ Boolean): Iterable[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).filterNot(p)
    Definition Classes
    TraversableLike → GenTraversableLike
  26. def find(p: (NodeT) ⇒ Boolean): Option[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).find(p)
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  27. def flatMap[B](f: (NodeT) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from InnerEdge to MonadOps[NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: MonadOps[NodeT]).flatMap(f)
    Definition Classes
    MonadOps
  28. def flatMap[B, That](f: (NodeT) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).flatMap(f)(bf)
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  29. def flatten: Iterator[N]
    Implicit
    This member is added by an implicit conversion from InnerEdge to FlattenOps[N] performed by method flattenTraversableOnce in scala.collection.TraversableOnce. This conversion will take place only if an implicit value of type (InnerNodeParam[N]) ⇒ TraversableOnce[N] is in scope.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: FlattenOps[N]).flatten
    Definition Classes
    FlattenOps
  30. def flatten[B](implicit asTraversable: (NodeT) ⇒ GenTraversableOnce[B]): Iterable[B]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).flatten(asTraversable)
    Definition Classes
    GenericTraversableTemplate
  31. def fold[A1 >: NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).fold(z)(op)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  32. def foldLeft[B](z: B)(op: (B, NodeT) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).foldLeft(z)(op)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def foldRight[B](z: B)(op: (NodeT, B) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).foldRight(z)(op)
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  34. def forall(p: (NodeT) ⇒ Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).forall(p)
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  35. def foreach[U](f: (NodeT) ⇒ U): Unit
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).foreach(f)
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  36. def genericBuilder[B]: Builder[B, Iterable[B]]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).genericBuilder
    Definition Classes
    GenericTraversableTemplate
  37. def groupBy[K](f: (NodeT) ⇒ K): Map[K, Iterable[NodeT]]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).groupBy(f)
    Definition Classes
    TraversableLike → GenTraversableLike
  38. def grouped(size: Int): Iterator[Iterable[NodeT]]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).grouped(size)
    Definition Classes
    IterableLike
  39. def hasDefiniteSize: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).hasDefiniteSize
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  40. def hashCode(): Int
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).hashCode()
    Definition Classes
    EdgeLike → AnyRef → Any
  41. def head: NodeT
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).head
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  42. def headOption: Option[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).headOption
    Definition Classes
    TraversableLike → GenTraversableLike
  43. def init: Iterable[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).init
    Definition Classes
    TraversableLike → GenTraversableLike
  44. def inits: Iterator[Iterable[NodeT]]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).inits
    Definition Classes
    TraversableLike
  45. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: OuterNode[InnerEdge]).isDefined
    Definition Classes
    Param
  46. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).isDefined
    Definition Classes
    Param
  47. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: OuterNode[InnerEdge]).isEdge
    Definition Classes
    Param
  48. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).isEdge
    Definition Classes
    Param
  49. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).isEmpty
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  50. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: OuterNode[InnerEdge]).isIn
    Definition Classes
    InParam → Param
  51. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).isIn
    Definition Classes
    InParam → Param
  52. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: OuterNode[InnerEdge]).isNode
    Definition Classes
    NodeParam
  53. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).isNode
    Definition Classes
    EdgeParam
  54. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: OuterNode[InnerEdge]).isOut
    Definition Classes
    Param
  55. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).isOut
    Definition Classes
    Param
  56. final def isTraversableAgain: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).isTraversableAgain
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  57. def iterator: Iterator[NodeT]

    Iterator for the nodes (end-points) of this edge.

    Iterator for the nodes (end-points) of this edge.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).iterator
    Definition Classes
    EdgeLike → IterableLike → GenIterableLike
  58. def last: NodeT
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).last
    Definition Classes
    TraversableLike → GenTraversableLike
  59. def lastOption: Option[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).lastOption
    Definition Classes
    TraversableLike → GenTraversableLike
  60. def map[B](f: (NodeT) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from InnerEdge to MonadOps[NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: MonadOps[NodeT]).map(f)
    Definition Classes
    MonadOps
  61. def map[B, That](f: (NodeT) ⇒ B)(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).map(f)(bf)
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  62. def max[B >: NodeT](implicit cmp: Ordering[B]): NodeT
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).max(cmp)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  63. def maxBy[B](f: (NodeT) ⇒ B)(implicit cmp: Ordering[B]): NodeT
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).maxBy(f)(cmp)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  64. def min[B >: NodeT](implicit cmp: Ordering[B]): NodeT
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).min(cmp)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  65. def minBy[B](f: (NodeT) ⇒ B)(implicit cmp: Ordering[B]): NodeT
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).minBy(f)(cmp)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  66. def mkString: String
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).mkString
    Definition Classes
    TraversableOnce → GenTraversableOnce
  67. def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).mkString(sep)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  68. def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).mkString(start, sep, end)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  69. def nodes: Product

    The end nodes joined by this edge.

    The end nodes joined by this edge.

    Nodes will typically be represented by Tuples. Alternatively subclasses of Iterable implementing Product, such as List, may also be used. In the latter case be aware of higher memory footprint.

    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).nodes
    Definition Classes
    EdgeLike
  70. def nonEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).nonEmpty
    Definition Classes
    TraversableOnce → GenTraversableOnce
  71. def par: ParIterable[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).par
    Definition Classes
    Parallelizable
  72. def partition(p: (NodeT) ⇒ Boolean): (Iterable[NodeT], Iterable[NodeT])
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).partition(p)
    Definition Classes
    TraversableLike → GenTraversableLike
  73. def product[B >: NodeT](implicit num: Numeric[B]): B
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).product(num)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  74. def reduce[A1 >: NodeT](op: (A1, A1) ⇒ A1): A1
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).reduce(op)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  75. def reduceLeft[B >: NodeT](op: (B, NodeT) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).reduceLeft(op)
    Definition Classes
    TraversableOnce
  76. def reduceLeftOption[B >: NodeT](op: (B, NodeT) ⇒ B): Option[B]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).reduceLeftOption(op)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  77. def reduceOption[A1 >: NodeT](op: (A1, A1) ⇒ A1): Option[A1]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).reduceOption(op)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  78. def reduceRight[B >: NodeT](op: (NodeT, B) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).reduceRight(op)
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  79. def reduceRightOption[B >: NodeT](op: (NodeT, B) ⇒ B): Option[B]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).reduceRightOption(op)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  80. def repr: Iterable[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).repr
    Definition Classes
    TraversableLike → GenTraversableLike
  81. def sameElements[B >: NodeT](that: GenIterable[B]): Boolean
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).sameElements(that)
    Definition Classes
    IterableLike → GenIterableLike
  82. def scan[B >: NodeT, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).scan(z)(op)(cbf)
    Definition Classes
    TraversableLike → GenTraversableLike
  83. def scanLeft[B, That](z: B)(op: (B, NodeT) ⇒ B)(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).scanLeft(z)(op)(bf)
    Definition Classes
    TraversableLike → GenTraversableLike
  84. def scanRight[B, That](z: B)(op: (NodeT, B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[NodeT], B, That]): That
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).scanRight(z)(op)(bf)
    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.

  85. def seq: Iterable[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).seq
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  86. def size: Int
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).size
    Definition Classes
    TraversableOnce → GenTraversableOnce
  87. def slice(from: Int, until: Int): Iterable[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).slice(from, until)
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  88. def sliding(size: Int, step: Int): Iterator[Iterable[NodeT]]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).sliding(size, step)
    Definition Classes
    IterableLike
  89. def sliding(size: Int): Iterator[Iterable[NodeT]]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).sliding(size)
    Definition Classes
    IterableLike
  90. def span(p: (NodeT) ⇒ Boolean): (Iterable[NodeT], Iterable[NodeT])
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).span(p)
    Definition Classes
    TraversableLike → GenTraversableLike
  91. def splitAt(n: Int): (Iterable[NodeT], Iterable[NodeT])
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).splitAt(n)
    Definition Classes
    TraversableLike → GenTraversableLike
  92. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: OuterNode[InnerEdge]).stringPrefix
    Definition Classes
    NodeParam
  93. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).stringPrefix
    Definition Classes
    EdgeLike → TraversableLike → GenTraversableLike
  94. def sum[B >: NodeT](implicit num: Numeric[B]): B
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).sum(num)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. def tail: Iterable[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).tail
    Definition Classes
    TraversableLike → GenTraversableLike
  96. def tails: Iterator[Iterable[NodeT]]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).tails
    Definition Classes
    TraversableLike
  97. def take(n: Int): Iterable[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).take(n)
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  98. def takeRight(n: Int): Iterable[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).takeRight(n)
    Definition Classes
    IterableLike
  99. def takeWhile(p: (NodeT) ⇒ Boolean): Iterable[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).takeWhile(p)
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  100. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, NodeT, Col[NodeT]]): Col[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).to(cbf)
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  101. def toArray[B >: NodeT](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).toArray(arg0)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  102. def toBuffer[B >: NodeT]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).toBuffer
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. def toIndexedSeq: IndexedSeq[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).toIndexedSeq
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. def toIterable: Iterable[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).toIterable
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  105. def toIterator: Iterator[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).toIterator
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  106. def toList: List[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).toList
    Definition Classes
    TraversableOnce → GenTraversableOnce
  107. def toMap[T, U](implicit ev: <:<[NodeT, (T, U)]): Map[T, U]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).toMap(ev)
    Definition Classes
    TraversableOnce → GenTraversableOnce
  108. def toSeq: Seq[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).toSeq
    Definition Classes
    TraversableOnce → GenTraversableOnce
  109. def toSet[B >: NodeT]: Set[B]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).toSet
    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. def toStream: Stream[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).toStream
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  111. def toString(): String
    Implicit
    This member is added by an implicit conversion from InnerEdge to OuterNode[InnerEdge] performed by method anyToNode in scalax.collection.GraphPredef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: OuterNode[InnerEdge]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  112. def toString(): String
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).toString()
    Definition Classes
    EdgeLike → TraversableLike → AnyRef → Any
  113. def toTraversable: Traversable[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).toTraversable
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  114. def toVector: Vector[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).toVector
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def transpose[B](implicit asTraversable: (NodeT) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).transpose(asTraversable)
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  116. def unzip[A1, A2](implicit asPair: (NodeT) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).unzip(asPair)
    Definition Classes
    GenericTraversableTemplate
  117. def unzip3[A1, A2, A3](implicit asTriple: (NodeT) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).unzip3(asTriple)
    Definition Classes
    GenericTraversableTemplate
  118. def view(from: Int, until: Int): IterableView[NodeT, Iterable[NodeT]]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).view(from, until)
    Definition Classes
    IterableLike → TraversableLike
  119. def view: IterableView[NodeT, Iterable[NodeT]]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).view
    Definition Classes
    IterableLike → TraversableLike
  120. def withFilter(p: (NodeT) ⇒ Boolean): Iterator[NodeT]
    Implicit
    This member is added by an implicit conversion from InnerEdge to MonadOps[NodeT] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: MonadOps[NodeT]).withFilter(p)
    Definition Classes
    MonadOps
  121. def withFilter(p: (NodeT) ⇒ Boolean): FilterMonadic[NodeT, Iterable[NodeT]]
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).withFilter(p)
    Definition Classes
    TraversableLike → FilterMonadic
  122. def zip[A1 >: NodeT, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[NodeT], (A1, B), That]): That
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).zip(that)(bf)
    Definition Classes
    IterableLike → GenIterableLike
  123. def zipAll[B, A1 >: NodeT, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[NodeT], (A1, B), That]): That
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).zipAll(that, thisElem, thatElem)(bf)
    Definition Classes
    IterableLike → GenIterableLike
  124. def zipWithIndex[A1 >: NodeT, That](implicit bf: CanBuildFrom[Iterable[NodeT], (A1, Int), That]): That
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).zipWithIndex(bf)
    Definition Classes
    IterableLike → GenIterableLike

Deprecated Value Members

  1. def /:[B](z: B)(op: (B, NodeT) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT])./:(z)(op)
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldLeft instead of /:

  2. def /:[B](z: B)(op: (B, NodeT) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldLeft instead of /:

  3. def :\[B](z: B)(op: (NodeT, B) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from InnerEdge to E[NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (innerEdge: E[NodeT]).:\(z)(op)
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldRight instead of :\

  4. def :\[B](z: B)(op: (NodeT, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldRight instead of :\

  5. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] ) @Deprecated @deprecated
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

  6. def toEdgeIn: E[N]
    Annotations
    @deprecated
    Deprecated

    (Since version 1.8.0) Use toOuter instead

Inherited from InnerElem

Inherited from Edge

Inherited from Serializable

Inherited from Serializable

Inherited from InnerEdgeParam[N, E, NodeT, E]

Inherited from EdgeParam

Inherited from OutParam[N, E]

Inherited from Param[N, E]

Inherited from Iterable[NodeT]

Inherited from IterableLike[NodeT, Iterable[NodeT]]

Inherited from Equals

Inherited from GenIterable[NodeT]

Inherited from GenIterableLike[NodeT, Iterable[NodeT]]

Inherited from Traversable[NodeT]

Inherited from GenTraversable[NodeT]

Inherited from GenericTraversableTemplate[NodeT, Iterable]

Inherited from TraversableLike[NodeT, Iterable[NodeT]]

Inherited from GenTraversableLike[NodeT, Iterable[NodeT]]

Inherited from Parallelizable[NodeT, ParIterable[NodeT]]

Inherited from TraversableOnce[NodeT]

Inherited from GenTraversableOnce[NodeT]

Inherited from FilterMonadic[NodeT, Iterable[NodeT]]

Inherited from HasNewBuilder[NodeT, Iterable[GraphBase.this.NodeT] @scala.annotation.unchecked.uncheckedVariance]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion anyToNode from InnerEdge to OuterNode[InnerEdge]

Inherited by implicit conversion CollectionsHaveToParArray from InnerEdge to CollectionsHaveToParArray[InnerEdge, T]

Inherited by implicit conversion MonadOps from InnerEdge to MonadOps[NodeT]

Inherited by implicit conversion flattenTraversableOnce from InnerEdge to FlattenOps[N]

Inherited by implicit conversion EdgeAssoc from InnerEdge to EdgeAssoc[InnerEdge]

Inherited by implicit conversion TraversableEnrichments from InnerEdge to TraversableEnrichments[NodeT, Iterable]

Inherited by implicit conversion ChainingOps from InnerEdge to ChainingOps[InnerEdge]

Inherited by implicit conversion toEdge from InnerEdge to E[NodeT]

Inherited by implicit conversion any2stringadd from InnerEdge to any2stringadd[InnerEdge]

Inherited by implicit conversion StringFormat from InnerEdge to StringFormat[InnerEdge]

Inherited by implicit conversion Ensuring from InnerEdge to Ensuring[InnerEdge]

Inherited by implicit conversion ArrowAssoc from InnerEdge to ArrowAssoc[InnerEdge]

Inherited by implicit conversion alternateImplicit from InnerEdge to ForceImplicitAmbiguity

Ungrouped