scalax.collection.GraphBase

InnerEdge

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

Self Type
EdgeT
Linear Supertypes
InnerElem, Edge, Serializable, Serializable, InnerEdgeParam[N, E, NodeT, E], EdgeParam, OutParam[N, E], Param[N, E], Iterable[NodeT], IterableLike[NodeT, Iterable[NodeT]], Equals, GenIterable[NodeT], GenIterableLike[NodeT, Iterable[NodeT]], Traversable[NodeT], GenTraversable[NodeT], GenericTraversableTemplate[NodeT, Iterable], TraversableLike[NodeT, Iterable[NodeT]], GenTraversableLike[NodeT, Iterable[NodeT]], Parallelizable[NodeT, ParIterable[NodeT]], TraversableOnce[NodeT], GenTraversableOnce[NodeT], FilterMonadic[NodeT, Iterable[NodeT]], HasNewBuilder[NodeT, Iterable[GraphBase.this.NodeT] @scala.annotation.unchecked.uncheckedVariance], AnyRef, Any
Known Subclasses
EdgeBase, EdgeImpl
Type Hierarchy Learn more about scaladoc diagrams
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 graphParamsToPartition
  7. by toEdge
  8. by any2stringadd
  9. by StringFormat
  10. by Ensuring
  11. by ArrowAssoc
  12. by alternateImplicit
  1. Hide All
  2. Show all
Learn more about member selection
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 information
    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 information
    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. def /:[B](z: B)(op: (B, NodeT) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  9. def :\[B](z: B)(op: (NodeT, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef → Any

  11. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce

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

    Definition Classes
    TraversableOnce

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

  15. def aggregate[B](z: ⇒ B)(seqop: (B, NodeT) ⇒ B, combop: (B, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  16. 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. Hyper-edges may link more than two nodes.

    Implicit information
    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

  17. final def asEdgeT[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G): GraphPredef.InnerEdgeParam.asEdgeT.G.EdgeT

    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerEdgeParam

  18. final def asEdgeTProjection[N <: N, E[X] <: EdgeLikeIn[X]]: EdgeT

    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerEdgeParam

  19. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  20. def canEqual(that: Any): Boolean

    Definition Classes
    InnerEdge → IterableLike → Equals

  21. def clone(): AnyRef

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

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

    Definition Classes
    TraversableLike → GenTraversableLike

  23. def collectFirst[B](pf: PartialFunction[NodeT, B]): Option[B]

    Definition Classes
    TraversableOnce

  24. def companion: GenericCompanion[Iterable]

    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate

  25. final def contains[M >: N](node: M): Boolean

    Same as isAt.

    Same as isAt.

    Implicit information
    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()

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

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  27. def copyToArray[B >: NodeT](xs: Array[B]): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  29. def copyToBuffer[B >: NodeT](dest: Buffer[B]): Unit

    Definition Classes
    TraversableOnce

  30. def count(p: (NodeT) ⇒ Boolean): Int

    Definition Classes
    TraversableOnce → GenTraversableOnce

  31. def directed: Boolean

    true it this edge is directed.

    true it this edge is directed.

    Implicit information
    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

  32. def drop(n: Int): Iterable[NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  33. def dropRight(n: Int): Iterable[NodeT]

    Definition Classes
    IterableLike

  34. def dropWhile(p: (NodeT) ⇒ Boolean): Iterable[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  35. def edgeParams: Iterable[EdgeParam]

    Implicit information
    This member is added by an implicit conversion from InnerEdge to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions

  36. val elems: Iterable[Param[N, E]]

    Implicit information
    This member is added by an implicit conversion from InnerEdge to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions

  37. def ensuring(cond: (InnerEdge) ⇒ Boolean, msg: ⇒ Any): InnerEdge

    Implicit information
    This member is added by an implicit conversion from InnerEdge to Ensuring[InnerEdge] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  38. def ensuring(cond: (InnerEdge) ⇒ Boolean): InnerEdge

    Implicit information
    This member is added by an implicit conversion from InnerEdge to Ensuring[InnerEdge] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  39. def ensuring(cond: Boolean, msg: ⇒ Any): InnerEdge

    Implicit information
    This member is added by an implicit conversion from InnerEdge to Ensuring[InnerEdge] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  40. def ensuring(cond: Boolean): InnerEdge

    Implicit information
    This member is added by an implicit conversion from InnerEdge to Ensuring[InnerEdge] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring

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

    Definition Classes
    AnyRef

  42. def equals(other: Any): Boolean

    Definition Classes
    InnerEdge → Equals → AnyRef → Any

  43. def exists(p: (NodeT) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  44. def filter(p: (NodeT) ⇒ Boolean): Iterable[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  45. def filterNot(p: (NodeT) ⇒ Boolean): Iterable[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  46. def finalize(): Unit

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

  47. def find(p: (NodeT) ⇒ Boolean): Option[NodeT]

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  49. def flatten[B](implicit asTraversable: (NodeT) ⇒ GenTraversableOnce[B]): Iterable[B]

    Definition Classes
    GenericTraversableTemplate

  50. final def fold[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton, T](g: G)(fa: (GraphPredef.InnerEdgeParam.fold.G.EdgeT) ⇒ T, fb: (EdgeT) ⇒ T): T

    Definition Classes
    InnerEdgeParam

  51. def fold[A1 >: NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

  52. def foldLeft[B](z: B)(op: (B, NodeT) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  53. def foldRight[B](z: B)(op: (NodeT, B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  54. def forall(p: (NodeT) ⇒ Boolean): Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  55. def foreach[U](f: (NodeT) ⇒ U): Unit

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

  56. def formatted(fmtstr: String): String

    Implicit information
    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()

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

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    AnyRef → Any

  59. def groupBy[K](f: (NodeT) ⇒ K): Map[K, Iterable[NodeT]]

    Definition Classes
    TraversableLike → GenTraversableLike

  60. def grouped(size: Int): Iterator[Iterable[NodeT]]

    Definition Classes
    IterableLike

  61. def hasDefiniteSize: Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  62. 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 information
    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

  63. 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 information
    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

  64. 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 information
    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

  65. 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 information
    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

  66. def hashCode(): Int

    Definition Classes
    InnerEdge → AnyRef → Any

  67. def head: NodeT

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  68. def headOption: Option[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  69. def init: Iterable[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  70. def inits: Iterator[Iterable[NodeT]]

    Definition Classes
    TraversableLike

  71. 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 information
    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

  72. def isAt[M >: N](node: M): Boolean

    true if node is incident with this edge.

    true if node is incident with this edge.

    Implicit information
    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

  73. final def isContaining[N <: N, E[X] <: EdgeLikeIn[X]](g: GraphBase[N, E]): Boolean

    Definition Classes
    InnerEdgeParam

  74. def isDefined: Boolean

    Definition Classes
    Param

  75. final def isDirected: Boolean

    Same as directed.

    Same as directed.

    Implicit information
    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()

  76. def isEdge: Boolean

    Definition Classes
    EdgeParam

  77. def isEmpty: Boolean

    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  78. 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 information
    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

  79. def isIn: Boolean

    Definition Classes
    OutParam → Param

  80. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  81. def isLabeled: Boolean

    true if this edge is labeled.

    true if this edge is labeled. See also label.

    Implicit information
    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

  82. 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 information
    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

  83. def isNode: Boolean

    Definition Classes
    EdgeParam

  84. def isOut: Boolean

    Definition Classes
    OutParam → Param

  85. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

  86. final def isUndirected: Boolean

    Same as undirected.

    Same as undirected.

    Implicit information
    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()

  87. 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) meaning that edges of different labels connecting the same nodes will be treated as equal and not added more than once. If 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 information
    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.

  88. def last: NodeT

    Definition Classes
    TraversableLike → GenTraversableLike

  89. def lastOption: Option[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  91. 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 information
    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

  92. 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 information
    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

  93. def max[B >: NodeT](implicit cmp: Ordering[B]): NodeT

    Definition Classes
    TraversableOnce → GenTraversableOnce

  94. def maxBy[B](f: (NodeT) ⇒ B)(implicit cmp: Ordering[B]): NodeT

    Definition Classes
    TraversableOnce → GenTraversableOnce

  95. def min[B >: NodeT](implicit cmp: Ordering[B]): NodeT

    Definition Classes
    TraversableOnce → GenTraversableOnce

  96. def minBy[B](f: (NodeT) ⇒ B)(implicit cmp: Ordering[B]): NodeT

    Definition Classes
    TraversableOnce → GenTraversableOnce

  97. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  98. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce → GenTraversableOnce

  100. val n1: InnerEdge

    Implicit information
    This member is added by an implicit conversion from InnerEdge to EdgeAssoc[InnerEdge] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc

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

    Definition Classes
    AnyRef

  102. def newBuilder: Builder[NodeT, Iterable[NodeT]]

    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder

  103. def nodeParams: Iterable[NodeParam[N]]

    Implicit information
    This member is added by an implicit conversion from InnerEdge to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions

  104. def nodeSeq: Seq[NodeT]

    Sequence of the end points of this edge.

    Sequence of the end points of this edge.

    Implicit information
    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

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

  106. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce

  107. final def nonHyperEdge: Boolean

    true if this edge has exactly two ends.

    true if this edge has exactly two ends.

    Implicit information
    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()

  108. final def nonLooping: Boolean

    Same as ! looping.

    Same as ! looping.

    Implicit information
    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

  109. final def notify(): Unit

    Definition Classes
    AnyRef

  110. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  111. def par: ParIterable[NodeT]

    Definition Classes
    Parallelizable

  112. def parCombiner: Combiner[NodeT, ParIterable[NodeT]]

    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable

  113. def partition(p: (NodeT) ⇒ Boolean): (Iterable[NodeT], Iterable[NodeT])

    Definition Classes
    TraversableLike → GenTraversableLike

  114. lazy val partitioned: (Iterable[Param[N, E]], Iterable[Param[N, E]])

    Implicit information
    This member is added by an implicit conversion from InnerEdge to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions

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

  116. def product[B >: NodeT](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  117. def reduce[A1 >: NodeT](op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

  118. def reduceLeft[B >: NodeT](op: (B, NodeT) ⇒ B): B

    Definition Classes
    TraversableOnce

  119. def reduceLeftOption[B >: NodeT](op: (B, NodeT) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  120. def reduceOption[A1 >: NodeT](op: (A1, A1) ⇒ A1): Option[A1]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  121. def reduceRight[B >: NodeT](op: (NodeT, B) ⇒ B): B

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  122. def reduceRightOption[B >: NodeT](op: (NodeT, B) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  123. def repr: Iterable[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  124. def reversed: List[NodeT]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

  125. def sameElements[B >: NodeT](that: GenIterable[B]): Boolean

    Definition Classes
    IterableLike → GenIterableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

    Definition Classes
    TraversableLike → GenTraversableLike

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

  129. def seq: Iterable[NodeT]

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

  130. def size: Int

    Definition Classes
    TraversableOnce → GenTraversableOnce

  131. def slice(from: Int, until: Int): Iterable[NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  132. def sliding(size: Int, step: Int): Iterator[Iterable[NodeT]]

    Definition Classes
    IterableLike

  133. def sliding(size: Int): Iterator[Iterable[NodeT]]

    Definition Classes
    IterableLike

  134. def span(p: (NodeT) ⇒ Boolean): (Iterable[NodeT], Iterable[NodeT])

    Definition Classes
    TraversableLike → GenTraversableLike

  135. def splitAt(n: Int): (Iterable[NodeT], Iterable[NodeT])

    Definition Classes
    TraversableLike → GenTraversableLike

  136. def stringPrefix: String

    Definition Classes
    InnerEdge → InnerEdgeParam → TraversableLike → GenTraversableLike

  137. def sum[B >: NodeT](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    AnyRef

  139. def tail: Iterable[NodeT]

    Definition Classes
    TraversableLike → GenTraversableLike

  140. def tails: Iterator[Iterable[NodeT]]

    Definition Classes
    TraversableLike

  141. def take(n: Int): Iterable[NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  142. def takeRight(n: Int): Iterable[NodeT]

    Definition Classes
    IterableLike

  143. def takeWhile(p: (NodeT) ⇒ Boolean): Iterable[NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike

  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] with Singleton](g: G)(f: (EdgeT) ⇒ GraphPredef.InnerEdgeParam.toEdgeT.G.EdgeT): GraphPredef.InnerEdgeParam.toEdgeT.G.EdgeT

    Definition Classes
    InnerEdgeParam

  151. def toInParams: Iterable[InParam[N, E]]

    Implicit information
    This member is added by an implicit conversion from InnerEdge to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions

  152. def toIndexedSeq: IndexedSeq[NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  153. def toIterable: Iterable[NodeT]

    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce

  154. def toIterator: Iterator[NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  155. def toList: List[NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  156. def toMap[T, U](implicit ev: <:<[NodeT, (T, U)]): Map[T, U]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  157. def toOuter: E[N]

    Reconstructs the outer edge by means of the copy method.

  158. def toOuterEdges: Iterable[E[N]]

    Implicit information
    This member is added by an implicit conversion from InnerEdge to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions

  159. def toOuterNodes: Iterable[N]

    Implicit information
    This member is added by an implicit conversion from InnerEdge to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef.
    Definition Classes
    Partitions

  160. def toParArray: ParArray[T]

    Implicit information
    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

  161. def toSeq: Seq[NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  162. def toSet[B >: NodeT]: Set[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  163. def toStream: Stream[NodeT]

    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce

  164. def toString(): String

    Definition Classes
    InnerEdge → InnerEdgeParam → TraversableLike → AnyRef → Any

  165. def toTraversable: Traversable[NodeT]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  166. def toVector: Vector[NodeT]

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

  168. final def undirected: Boolean

    true it this edge is undirected.

    true it this edge is undirected.

    Implicit information
    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()

  169. def unzip[A1, A2](implicit asPair: (NodeT) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

    Definition Classes
    GenericTraversableTemplate

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

    Definition Classes
    GenericTraversableTemplate

  171. val value: InnerEdge

    Implicit information
    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

  172. def view(from: Int, until: Int): IterableView[NodeT, Iterable[NodeT]]

    Definition Classes
    IterableLike → TraversableLike

  173. def view: IterableView[NodeT, Iterable[NodeT]]

    Definition Classes
    IterableLike → TraversableLike

  174. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  177. def weight: Long

    The weight of this edge defaulting to 1L.

    The weight of this edge defaulting to 1L.

    Note that weight is normally not part of the edge key (hashCode) meaning that edges of different weights connecting the same nodes will be treated as equal and not added more than once. If 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.

    In case of weights of a type other than Long you either convert values of that type to Long prior to edge creation or define a custom edge class to include your own val of that type and override def weight to provide a conversion.

    Implicit information
    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 withFilter(p: (NodeT) ⇒ Boolean): FilterMonadic[NodeT, Iterable[NodeT]]

    Definition Classes
    TraversableLike → FilterMonadic

  179. def withSources(f: (NodeT) ⇒ Unit): Unit

    Applies f to the source end resp.

    Applies f to the source end resp. to all source ends of this edge.

    Implicit information
    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

  180. def withTargets(f: (NodeT) ⇒ Unit): Unit

    Applies f to the target end resp.

    Applies f to the target end resp. to all target ends of this edge.

    Implicit information
    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

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

    Definition Classes
    IterableLike → GenIterableLike

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

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

    Definition Classes
    IterableLike → GenIterableLike

  184. def ~[N >: N1, N2 <: N](n2: N2): UnDiEdge[N]

    Implicit information
    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()

  185. def ~>[N >: N1, N2 <: N](n2: N2): DiEdge[N]

    Implicit information
    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()

  186. final def ~~: Set[EdgeT]

    Synonym for adjacents.

    Synonym for adjacents.

    Annotations
    @inline()

  187. def →[B](y: B): (InnerEdge, B)

    Implicit information
    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 information
    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 information
    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 information
    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 /:[B](z: B)(op: (B, NodeT) ⇒ B): B

    Implicit information
    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

  5. def :\[B](z: B)(op: (NodeT, B) ⇒ B): B

    Implicit information
    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

  6. def addString(b: StringBuilder): StringBuilder

    Implicit information
    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

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

    Implicit information
    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

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

    Implicit information
    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

  9. def aggregate[B](z: ⇒ B)(seqop: (B, NodeT) ⇒ B, combop: (B, B) ⇒ B): B

    Implicit information
    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

  10. def canEqual(that: Any): Boolean

    Implicit information
    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 → IterableLike → Equals

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

    Implicit information
    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

  12. def collectFirst[B](pf: PartialFunction[NodeT, B]): Option[B]

    Implicit information
    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

  13. def companion: GenericCompanion[Iterable]

    Implicit information
    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

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

    Implicit information
    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

  15. def copyToArray[B >: NodeT](xs: Array[B]): Unit

    Implicit information
    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

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

    Implicit information
    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

  17. def copyToBuffer[B >: NodeT](dest: Buffer[B]): Unit

    Implicit information
    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

  18. def count(p: (NodeT) ⇒ Boolean): Int

    Implicit information
    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

  19. def drop(n: Int): Iterable[NodeT]

    Implicit information
    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

  20. def dropRight(n: Int): Iterable[NodeT]

    Implicit information
    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

  21. def dropWhile(p: (NodeT) ⇒ Boolean): Iterable[NodeT]

    Implicit information
    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

  22. def edge: EdgeLike[NodeT]

    Implicit information
    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

  23. def equals(other: Any): Boolean

    Implicit information
    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

  24. def exists(p: (NodeT) ⇒ Boolean): Boolean

    Implicit information
    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

  25. def filter(p: (NodeT) ⇒ Boolean): TraversableOnce[NodeT]

    Implicit information
    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

  26. def filter(p: (NodeT) ⇒ Boolean): Iterable[NodeT]

    Implicit information
    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

  27. def filterNot(p: (NodeT) ⇒ Boolean): Iterable[NodeT]

    Implicit information
    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

  28. def find(p: (NodeT) ⇒ Boolean): Option[NodeT]

    Implicit information
    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

  29. def flatMap[B](f: (NodeT) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

    Implicit information
    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

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

    Implicit information
    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

  31. def flatten: Iterator[N]

    Implicit information
    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

  32. def flatten[B](implicit asTraversable: (NodeT) ⇒ GenTraversableOnce[B]): Iterable[B]

    Implicit information
    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

  33. def fold[A1 >: NodeT](z: A1)(op: (A1, A1) ⇒ A1): A1

    Implicit information
    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

  34. def foldLeft[B](z: B)(op: (B, NodeT) ⇒ B): B

    Implicit information
    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

  35. def foldRight[B](z: B)(op: (NodeT, B) ⇒ B): B

    Implicit information
    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

  36. def forall(p: (NodeT) ⇒ Boolean): Boolean

    Implicit information
    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

  37. def foreach[U](f: (NodeT) ⇒ U): Unit

    Implicit information
    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

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

    Implicit information
    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

  39. def groupBy[K](f: (NodeT) ⇒ K): Map[K, Iterable[NodeT]]

    Implicit information
    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

  40. def grouped(size: Int): Iterator[Iterable[NodeT]]

    Implicit information
    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

  41. def hasDefiniteSize: Boolean

    Implicit information
    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

  42. def hashCode(): Int

    Implicit information
    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

  43. def head: NodeT

    Implicit information
    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

  44. def headOption: Option[NodeT]

    Implicit information
    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

  45. def init: Iterable[NodeT]

    Implicit information
    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

  46. def inits: Iterator[Iterable[NodeT]]

    Implicit information
    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

  47. def isDefined: Boolean

    Implicit information
    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

  48. def isDefined: Boolean

    Implicit information
    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

  49. def isEdge: Boolean

    Implicit information
    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
    NodeParam

  50. def isEdge: Boolean

    Implicit information
    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
    EdgeParam

  51. def isEmpty: Boolean

    Implicit information
    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

  52. def isIn: Boolean

    Implicit information
    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

  53. def isIn: Boolean

    Implicit information
    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

  54. def isNode: Boolean

    Implicit information
    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

  55. def isNode: Boolean

    Implicit information
    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

  56. def isOut: Boolean

    Implicit information
    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
    InParam → Param

  57. def isOut: Boolean

    Implicit information
    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
    InParam → Param

  58. final def isTraversableAgain: Boolean

    Implicit information
    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

  59. def iterator: Iterator[NodeT]

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

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

    Implicit information
    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

  60. def last: NodeT

    Implicit information
    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

  61. def lastOption: Option[NodeT]

    Implicit information
    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

  62. def map[B](f: (NodeT) ⇒ B): TraversableOnce[B]

    Implicit information
    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

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

    Implicit information
    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

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

    Implicit information
    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

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

    Implicit information
    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

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

    Implicit information
    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

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

    Implicit information
    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

  68. def mkString: String

    Implicit information
    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

  69. def mkString(sep: String): String

    Implicit information
    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

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

    Implicit information
    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

  71. 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 information
    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

  72. def nonEmpty: Boolean

    Implicit information
    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

  73. def par: ParIterable[NodeT]

    Implicit information
    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

  74. def partition(p: (NodeT) ⇒ Boolean): (Iterable[NodeT], Iterable[NodeT])

    Implicit information
    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

  75. def product[B >: NodeT](implicit num: Numeric[B]): B

    Implicit information
    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

  76. def reduce[A1 >: NodeT](op: (A1, A1) ⇒ A1): A1

    Implicit information
    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

  77. def reduceLeft[B >: NodeT](op: (B, NodeT) ⇒ B): B

    Implicit information
    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

  78. def reduceLeftOption[B >: NodeT](op: (B, NodeT) ⇒ B): Option[B]

    Implicit information
    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

  79. def reduceOption[A1 >: NodeT](op: (A1, A1) ⇒ A1): Option[A1]

    Implicit information
    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

  80. def reduceRight[B >: NodeT](op: (NodeT, B) ⇒ B): B

    Implicit information
    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

  81. def reduceRightOption[B >: NodeT](op: (NodeT, B) ⇒ B): Option[B]

    Implicit information
    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

  82. def repr: Iterable[NodeT]

    Implicit information
    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

  83. def sameElements[B >: NodeT](that: GenIterable[B]): Boolean

    Implicit information
    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

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

    Implicit information
    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

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

    Implicit information
    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

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

    Implicit information
    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.

  87. def seq: Iterable[NodeT]

    Implicit information
    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

  88. def size: Int

    Implicit information
    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

  89. def slice(from: Int, until: Int): Iterable[NodeT]

    Implicit information
    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

  90. def sliding(size: Int, step: Int): Iterator[Iterable[NodeT]]

    Implicit information
    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

  91. def sliding(size: Int): Iterator[Iterable[NodeT]]

    Implicit information
    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

  92. def span(p: (NodeT) ⇒ Boolean): (Iterable[NodeT], Iterable[NodeT])

    Implicit information
    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

  93. def splitAt(n: Int): (Iterable[NodeT], Iterable[NodeT])

    Implicit information
    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

  94. def stringPrefix: String

    Implicit information
    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

  95. def stringPrefix: String

    Implicit information
    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

  96. def sum[B >: NodeT](implicit num: Numeric[B]): B

    Implicit information
    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

  97. def tail: Iterable[NodeT]

    Implicit information
    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

  98. def tails: Iterator[Iterable[NodeT]]

    Implicit information
    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

  99. def take(n: Int): Iterable[NodeT]

    Implicit information
    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

  100. def takeRight(n: Int): Iterable[NodeT]

    Implicit information
    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

  101. def takeWhile(p: (NodeT) ⇒ Boolean): Iterable[NodeT]

    Implicit information
    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

  102. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, NodeT, Col[NodeT]]): Col[NodeT]

    Implicit information
    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

  103. def toArray[B >: NodeT](implicit arg0: ClassTag[B]): Array[B]

    Implicit information
    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

  104. def toBuffer[B >: NodeT]: Buffer[B]

    Implicit information
    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

  105. def toIndexedSeq: IndexedSeq[NodeT]

    Implicit information
    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

  106. def toIterable: Iterable[NodeT]

    Implicit information
    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

  107. def toIterator: Iterator[NodeT]

    Implicit information
    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" )

  108. def toList: List[NodeT]

    Implicit information
    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

  109. def toMap[T, U](implicit ev: <:<[NodeT, (T, U)]): Map[T, U]

    Implicit information
    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

  110. def toSeq: Seq[NodeT]

    Implicit information
    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

  111. def toSet[B >: NodeT]: Set[B]

    Implicit information
    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

  112. def toStream: Stream[NodeT]

    Implicit information
    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

  113. def toString(): String

    Implicit information
    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

  114. def toString(): String

    Implicit information
    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

  115. def toTraversable: Traversable[NodeT]

    Implicit information
    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" )

  116. def toVector: Vector[NodeT]

    Implicit information
    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

  117. def transpose[B](implicit asTraversable: (NodeT) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

    Implicit information
    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.

  118. def unzip[A1, A2](implicit asPair: (NodeT) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

    Implicit information
    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

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

    Implicit information
    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

  120. def view(from: Int, until: Int): IterableView[NodeT, Iterable[NodeT]]

    Implicit information
    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

  121. def view: IterableView[NodeT, Iterable[NodeT]]

    Implicit information
    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

  122. def withFilter(p: (NodeT) ⇒ Boolean): Iterator[NodeT]

    Implicit information
    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

  123. def withFilter(p: (NodeT) ⇒ Boolean): FilterMonadic[NodeT, Iterable[NodeT]]

    Implicit information
    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

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

    Implicit information
    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

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

    Implicit information
    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

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

    Implicit information
    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 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 graphParamsToPartition from InnerEdge to Partitions[N, E]

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