Packages

trait InnerEdge extends (GraphLike.this)#InnerEdge

Self Type
(GraphLike.this)#EdgeT
Linear Supertypes
(GraphLike.this)#InnerEdge, (GraphLike.this)#InnerElem, (GraphLike.this)#Edge, Serializable, InnerEdgeParam[N, E, (GraphLike.this)#NodeT, E], EdgeParam, OutParam[N, E], Param[N, E], Iterable[(GraphLike.this)#NodeT], IterableFactoryDefaults[(GraphLike.this)#NodeT, Iterable], IterableOps[(GraphLike.this)#NodeT, Iterable, Iterable[(GraphLike.this)#NodeT]], IterableOnceOps[(GraphLike.this)#NodeT, Iterable, Iterable[(GraphLike.this)#NodeT]], scala.collection.IterableOnce[(GraphLike.this)#NodeT], AnyRef, Any
Known Subclasses
EdgeBase, EdgeImpl
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. InnerEdge
  2. InnerEdge
  3. InnerElem
  4. Edge
  5. Serializable
  6. InnerEdgeParam
  7. EdgeParam
  8. OutParam
  9. Param
  10. Iterable
  11. IterableFactoryDefaults
  12. IterableOps
  13. IterableOnceOps
  14. IterableOnce
  15. AnyRef
  16. Any
Implicitly
  1. by iterableOnceExtensionMethods
  2. by EdgeAssoc
  3. by TraversableEnrichments
  4. by anyToNode
  5. by ChainingOps
  6. by toEdge
  7. by any2stringadd
  8. by StringFormat
  9. by Ensuring
  10. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Abstract Value Members

  1. abstract def edge: E[(GraphLike.this)#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[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnce

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toany2stringadd[(GraphLike.this)#InnerEdge] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. final def ++[B >: (GraphLike.this)#NodeT](suffix: scala.collection.IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
    Annotations
    @inline()
  5. def ->[B](y: B): ((GraphLike.this)#InnerEdge, B)
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toArrowAssoc[(GraphLike.this)#InnerEdge] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  6. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  7. final def addString(b: StringBuilder): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  8. final def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  9. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    IterableOnceOps
  10. def adjacents: Set[(GraphLike.this)#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.

    Definition Classes
    InnerEdge
  11. final def arity: Int

    Number of nodes linked by this Edge.

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

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  12. final def asEdgeT[N <: N, E[+X] <: EdgeLikeIn[X], G <: GraphBase[N, E]](g: G): GraphPredef.InnerEdgeParam.asEdgeT.G.EdgeT
    Attributes
    protected[collection]
    Definition Classes
    InnerEdgeParam
  13. final def asEdgeTProjection[N <: N, E[+X] <: EdgeLikeIn[X]]: GraphBase.EdgeT
    Attributes
    protected[collection]
    Definition Classes
    InnerEdgeParam
  14. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  15. def canEqual(that: Any): Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike → Eq
  16. def className: String
    Attributes
    protected[this]
    Definition Classes
    Iterable
  17. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  18. final def coll: InnerEdge.this.type
    Attributes
    protected
    Definition Classes
    Iterable → IterableOps
  19. def collect[B](pf: PartialFunction[(GraphLike.this)#NodeT, B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  20. def collectFirst[B](pf: PartialFunction[(GraphLike.this)#NodeT, B]): Option[B]
    Definition Classes
    IterableOnceOps
  21. def concat[B >: (GraphLike.this)#NodeT](suffix: scala.collection.IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
  22. final def containingGraph: (GraphLike.this)#ThisGraph

    The Graph instance that contains this inner edge.

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

    Same as isAt.

    Same as isAt.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
    Annotations
    @inline()
  24. def copyToArray[B >: (GraphLike.this)#NodeT](xs: Array[B], start: Int, len: Int): Int
    Definition Classes
    IterableOnceOps
  25. def copyToArray[B >: (GraphLike.this)#NodeT](xs: Array[B], start: Int): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  26. def copyToArray[B >: (GraphLike.this)#NodeT](xs: Array[B]): Int
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  27. def corresponds[B](that: scala.collection.IterableOnce[B])(p: ((GraphLike.this)#NodeT, B) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  28. def count(p: ((GraphLike.this)#NodeT) => Boolean): Int
    Definition Classes
    IterableOnceOps
  29. def directed: Boolean

    true if this edge is directed.

    true if this edge is directed.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  30. def drop(n: Int): Iterable[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  31. def dropRight(n: Int): Iterable[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps
  32. def dropWhile(p: ((GraphLike.this)#NodeT) => Boolean): Iterable[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  33. def empty: Iterable[(GraphLike.this)#NodeT]
    Definition Classes
    IterableFactoryDefaults → IterableOps
  34. def ensuring(cond: ((GraphLike.this)#InnerEdge) => Boolean, msg: => Any): (GraphLike.this)#InnerEdge
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toEnsuring[(GraphLike.this)#InnerEdge] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  35. def ensuring(cond: ((GraphLike.this)#InnerEdge) => Boolean): (GraphLike.this)#InnerEdge
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toEnsuring[(GraphLike.this)#InnerEdge] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  36. def ensuring(cond: Boolean, msg: => Any): (GraphLike.this)#InnerEdge
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toEnsuring[(GraphLike.this)#InnerEdge] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  37. def ensuring(cond: Boolean): (GraphLike.this)#InnerEdge
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toEnsuring[(GraphLike.this)#InnerEdge] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  38. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  39. def equals(other: Any): Boolean
    Definition Classes
    InnerEdge → AnyRef → Any
  40. def exists(p: ((GraphLike.this)#NodeT) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  41. def filter(pred: ((GraphLike.this)#NodeT) => Boolean): Iterable[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  42. def filterNot(pred: ((GraphLike.this)#NodeT) => Boolean): Iterable[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  43. def find(p: ((GraphLike.this)#NodeT) => Boolean): Option[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnceOps
  44. def flatMap[B](f: ((GraphLike.this)#NodeT) => scala.collection.IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  45. def flatten[B](implicit asIterable: ((GraphLike.this)#NodeT) => scala.collection.IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  46. final def fold[N <: N, E[+X] <: EdgeLikeIn[X], G <: GraphBase[N, E], T](g: G)(fa: (GraphPredef.InnerEdgeParam.fold.G.EdgeT) => T, fb: (GraphBase.EdgeT) => T): T
    Definition Classes
    InnerEdgeParam
  47. def fold[A1 >: (GraphLike.this)#NodeT](z: A1)(op: (A1, A1) => A1): A1
    Definition Classes
    IterableOnceOps
  48. def foldLeft[B](z: B)(op: (B, (GraphLike.this)#NodeT) => B): B
    Definition Classes
    IterableOnceOps
  49. def foldRight[B](z: B)(op: ((GraphLike.this)#NodeT, B) => B): B
    Definition Classes
    IterableOnceOps
  50. def forall(p: ((GraphLike.this)#NodeT) => Boolean): Boolean
    Definition Classes
    IterableOnceOps
  51. def foreach[U](f: ((GraphLike.this)#NodeT) => U): Unit
    Definition Classes
    IterableOnceOps
  52. def fromSpecific(coll: scala.collection.IterableOnce[(GraphLike.this)#NodeT]): Iterable[(GraphLike.this)#NodeT]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  53. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  54. def groupBy[K](f: ((GraphLike.this)#NodeT) => K): Map[K, Iterable[(GraphLike.this)#NodeT]]
    Definition Classes
    IterableOps
  55. def groupMap[K, B](key: ((GraphLike.this)#NodeT) => K)(f: ((GraphLike.this)#NodeT) => B): Map[K, Iterable[B]]
    Definition Classes
    IterableOps
  56. def groupMapReduce[K, B](key: ((GraphLike.this)#NodeT) => K)(f: ((GraphLike.this)#NodeT) => B)(reduce: (B, B) => B): Map[K, B]
    Definition Classes
    IterableOps
  57. def grouped(size: Int): Iterator[Iterable[(GraphLike.this)#NodeT]]
    Definition Classes
    IterableOps
  58. def hasSource(pred: ((GraphLike.this)#NodeT) => Boolean): Boolean

    true if any source end of this edge fulfills pred.

    true if any source end of this edge fulfills pred.

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

    true if node is a source of this edge.

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

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  60. def hasTarget(pred: ((GraphLike.this)#NodeT) => Boolean): Boolean

    true if any target end of this edge fulfills pred.

    true if any target end of this edge fulfills pred.

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

    true if node is a target of this edge.

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

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  62. def hashCode(): Int
    Definition Classes
    InnerEdge → AnyRef → Any
  63. def head: (GraphLike.this)#NodeT
    Definition Classes
    IterableOps
  64. def headOption: Option[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps
  65. def init: Iterable[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps
  66. def inits: Iterator[Iterable[(GraphLike.this)#NodeT]]
    Definition Classes
    IterableOps
  67. def isAt(pred: ((GraphLike.this)#NodeT) => Boolean): Boolean

    true if any end of this edge fulfills pred.

    true if any end of this edge fulfills pred.

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

    true if node is incident with this edge.

    true if node is incident with this edge.

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

    Same as directed.

    Same as directed.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
    Annotations
    @inline()
  72. final def isEdge: Boolean
    Definition Classes
    Param
  73. def isEmpty: Boolean
    Definition Classes
    IterableOnceOps
  74. def isHyperEdge: Boolean

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

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

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

    true if this edge is labeled.

    true if this edge is labeled. See also label.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  78. def isLooping: Boolean

    true if this edge produces a self-loop.

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

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  79. def isNode: Boolean
    Definition Classes
    EdgeParam
  80. final def isOut: Boolean
    Definition Classes
    Param
  81. def isTraversableAgain: Boolean
    Definition Classes
    IterableOps → IterableOnceOps
  82. final def isUndirected: Boolean

    Same as undirected.

    Same as undirected.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
    Annotations
    @inline()
  83. def iterableFactory: IterableFactory[Iterable]
    Definition Classes
    Iterable → IterableOps
  84. def knownSize: Int
    Definition Classes
    IterableOnce
  85. def label: Any

    The label of this edge.

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

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

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
    Exceptions thrown

    UnsupportedOperationException if the edge is non-labeled.

  86. def last: (GraphLike.this)#NodeT
    Definition Classes
    IterableOps
  87. def lastOption: Option[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps
  88. def lazyZip[B](that: Iterable[B]): LazyZip2[(GraphLike.this)#NodeT, B, InnerEdge.this.type]
    Definition Classes
    Iterable
  89. def map[B](f: ((GraphLike.this)#NodeT) => B): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  90. def matches(p1: ((GraphLike.this)#NodeT) => Boolean, p2: ((GraphLike.this)#NodeT) => Boolean): Boolean

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

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

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

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

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

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  92. def max[B >: (GraphLike.this)#NodeT](implicit ord: Ordering[B]): (GraphLike.this)#NodeT
    Definition Classes
    IterableOnceOps
  93. def maxBy[B](f: ((GraphLike.this)#NodeT) => B)(implicit cmp: Ordering[B]): (GraphLike.this)#NodeT
    Definition Classes
    IterableOnceOps
  94. def maxByOption[B](f: ((GraphLike.this)#NodeT) => B)(implicit cmp: Ordering[B]): Option[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnceOps
  95. def maxOption[B >: (GraphLike.this)#NodeT](implicit ord: Ordering[B]): Option[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnceOps
  96. def min[B >: (GraphLike.this)#NodeT](implicit ord: Ordering[B]): (GraphLike.this)#NodeT
    Definition Classes
    IterableOnceOps
  97. def minBy[B](f: ((GraphLike.this)#NodeT) => B)(implicit cmp: Ordering[B]): (GraphLike.this)#NodeT
    Definition Classes
    IterableOnceOps
  98. def minByOption[B](f: ((GraphLike.this)#NodeT) => B)(implicit cmp: Ordering[B]): Option[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnceOps
  99. def minOption[B >: (GraphLike.this)#NodeT](implicit ord: Ordering[B]): Option[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnceOps
  100. final def mkString: String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  101. final def mkString(sep: String): String
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  102. final def mkString(start: String, sep: String, end: String): String
    Definition Classes
    IterableOnceOps
  103. val n1: (GraphLike.this)#InnerEdge
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toEdgeAssoc[(GraphLike.this)#InnerEdge] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  104. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  105. def newSpecificBuilder: Builder[(GraphLike.this)#NodeT, Iterable[(GraphLike.this)#NodeT]]
    Attributes
    protected
    Definition Classes
    IterableFactoryDefaults → IterableOps
  106. def nodeSeq: Seq[(GraphLike.this)#NodeT]

    Sequence of the end points of this edge.

    Sequence of the end points of this edge.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  107. final def nodes: Iterable[(GraphLike.this)#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].

    Definition Classes
    InnerEdge
    Annotations
    @inline()
  108. def nonEmpty: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  109. final def nonHyperEdge: Boolean

    true if this edge has exactly two ends.

    true if this edge has exactly two ends.

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

    Same as ! looping.

    Same as ! looping.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  111. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  112. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  113. def partition(p: ((GraphLike.this)#NodeT) => Boolean): (Iterable[(GraphLike.this)#NodeT], Iterable[(GraphLike.this)#NodeT])
    Definition Classes
    IterableOps
  114. def partitionMap[A1, A2](f: ((GraphLike.this)#NodeT) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
    Definition Classes
    IterableOps
  115. def pipe[B](f: ((GraphLike.this)#InnerEdge) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toChainingOps[(GraphLike.this)#InnerEdge] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  116. def privateNodes: Set[(GraphLike.this)#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

    Definition Classes
    InnerEdge
  117. def product[B >: (GraphLike.this)#NodeT](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  118. def productElementNames: Iterator[String]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toOuterNode[(GraphLike.this)#InnerEdge] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    Product
  119. def reduce[B >: (GraphLike.this)#NodeT](op: (B, B) => B): B
    Definition Classes
    IterableOnceOps
  120. def reduceLeft[B >: (GraphLike.this)#NodeT](op: (B, (GraphLike.this)#NodeT) => B): B
    Definition Classes
    IterableOnceOps
  121. def reduceLeftOption[B >: (GraphLike.this)#NodeT](op: (B, (GraphLike.this)#NodeT) => B): Option[B]
    Definition Classes
    IterableOnceOps
  122. def reduceOption[B >: (GraphLike.this)#NodeT](op: (B, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  123. def reduceRight[B >: (GraphLike.this)#NodeT](op: ((GraphLike.this)#NodeT, B) => B): B
    Definition Classes
    IterableOnceOps
  124. def reduceRightOption[B >: (GraphLike.this)#NodeT](op: ((GraphLike.this)#NodeT, B) => B): Option[B]
    Definition Classes
    IterableOnceOps
  125. def reversed: Iterable[(GraphLike.this)#NodeT]
    Attributes
    protected
    Definition Classes
    IterableOnceOps
  126. def scan[B >: (GraphLike.this)#NodeT](z: B)(op: (B, B) => B): Iterable[B]
    Definition Classes
    IterableOps
  127. def scanLeft[B](z: B)(op: (B, (GraphLike.this)#NodeT) => B): Iterable[B]
    Definition Classes
    IterableOps → IterableOnceOps
  128. def scanRight[B](z: B)(op: ((GraphLike.this)#NodeT, B) => B): Iterable[B]
    Definition Classes
    IterableOps
  129. val self: (GraphLike.this)#InnerEdge
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toChainingOps[(GraphLike.this)#InnerEdge] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  130. def size: Int
    Definition Classes
    IterableOnceOps
  131. def sizeCompare(that: Iterable[_]): Int
    Definition Classes
    IterableOps
  132. def sizeCompare(otherSize: Int): Int
    Definition Classes
    IterableOps
  133. final def sizeIs: SizeCompareOps
    Definition Classes
    IterableOps
    Annotations
    @inline()
  134. def slice(from: Int, until: Int): Iterable[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  135. def sliding(size: Int, step: Int): Iterator[Iterable[(GraphLike.this)#NodeT]]
    Definition Classes
    IterableOps
  136. def sliding(size: Int): Iterator[Iterable[(GraphLike.this)#NodeT]]
    Definition Classes
    IterableOps
  137. def sources: Iterable[(GraphLike.this)#NodeT]

    All source ends of this edge.

    All source ends of this edge.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  138. def span(p: ((GraphLike.this)#NodeT) => Boolean): (Iterable[(GraphLike.this)#NodeT], Iterable[(GraphLike.this)#NodeT])
    Definition Classes
    IterableOps → IterableOnceOps
  139. def splitAt(n: Int): (Iterable[(GraphLike.this)#NodeT], Iterable[(GraphLike.this)#NodeT])
    Definition Classes
    IterableOps → IterableOnceOps
  140. def stepper[S <: Stepper[_]](implicit shape: StepperShape[(GraphLike.this)#NodeT, S]): S
    Definition Classes
    IterableOnce
  141. def stringPrefix: String
    Definition Classes
    InnerEdge → InnerEdgeParam → Iterable
  142. def sum[B >: (GraphLike.this)#NodeT](implicit num: Numeric[B]): B
    Definition Classes
    IterableOnceOps
  143. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  144. val t: Iterable[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toTraversableEnrichments[(GraphLike.this)#NodeT, Iterable] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  145. def tail: Iterable[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps
  146. def tails: Iterator[Iterable[(GraphLike.this)#NodeT]]
    Definition Classes
    IterableOps
  147. def take(n: Int): Iterable[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  148. def takeRight(n: Int): Iterable[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps
  149. def takeWhile(p: ((GraphLike.this)#NodeT) => Boolean): Iterable[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  150. def tap[U](f: ((GraphLike.this)#InnerEdge) => U): (GraphLike.this)#InnerEdge
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toChainingOps[(GraphLike.this)#InnerEdge] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  151. def tapEach[U](f: ((GraphLike.this)#NodeT) => U): Iterable[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps → IterableOnceOps
  152. def targets: Iterable[(GraphLike.this)#NodeT]

    All target ends of this edge.

    All target ends of this edge.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  153. def to: (GraphLike.this)#NodeT

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

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

    Definition Classes
    InnerEdge
  154. def to[C1](factory: Factory[(GraphLike.this)#NodeT, C1]): C1
    Definition Classes
    IterableOnceOps
  155. def toArray[B >: (GraphLike.this)#NodeT](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    IterableOnceOps
  156. final def toBuffer[B >: (GraphLike.this)#NodeT]: Buffer[B]
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  157. final def toEdgeT[N <: N, E[+X] <: EdgeLikeIn[X], G <: GraphBase[N, E]](g: G)(f: (GraphBase.EdgeT) => GraphPredef.InnerEdgeParam.toEdgeT.G.EdgeT): GraphPredef.InnerEdgeParam.toEdgeT.G.EdgeT
    Definition Classes
    InnerEdgeParam
  158. def toIndexedSeq: IndexedSeq[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnceOps
  159. def toList: List[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnceOps
  160. def toMap[K, V](implicit ev: <:<[(GraphLike.this)#NodeT, (K, V)]): Map[K, V]
    Definition Classes
    IterableOnceOps
  161. def toOuter: E[N]

    Reconstructs the outer edge by means of the copy method.

    Reconstructs the outer edge by means of the copy method.

    Definition Classes
    InnerEdge
  162. def toOuterNodes[E[+X] <: EdgeLike[X]]: Seq[InParam[(GraphLike.this)#NodeT, E]]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toTraversableEnrichments[(GraphLike.this)#NodeT, Iterable] performed by method TraversableEnrichments in scalax.collection.GraphPredef.
    Definition Classes
    TraversableEnrichments
  163. def toSeq: Seq[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnceOps
  164. def toSet[B >: (GraphLike.this)#NodeT]: Set[B]
    Definition Classes
    IterableOnceOps
  165. def toString(): String
    Definition Classes
    InnerEdge → InnerEdgeParam → Iterable → AnyRef → Any
  166. def toVector: Vector[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnceOps
  167. def transpose[B](implicit asIterable: ((GraphLike.this)#NodeT) => Iterable[B]): Iterable[Iterable[B]]
    Definition Classes
    IterableOps
  168. final def undirected: Boolean

    true if this edge is undirected.

    true if this edge is undirected.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
    Annotations
    @inline()
  169. def unzip[A1, A2](implicit asPair: ((GraphLike.this)#NodeT) => (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    IterableOps
  170. def unzip3[A1, A2, A3](implicit asTriple: ((GraphLike.this)#NodeT) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    IterableOps
  171. val value: (GraphLike.this)#InnerEdge
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toOuterNode[(GraphLike.this)#InnerEdge] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  172. def view: View[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps
  173. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  174. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  175. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  176. def weight: Double

    The weight of this edge with a default of 1.

    The weight of this edge with a default of 1.

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

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  177. def withFilter(p: ((GraphLike.this)#NodeT) => Boolean): WithFilter[(GraphLike.this)#NodeT, Iterable]
    Definition Classes
    IterableOps
  178. def withSources[U](f: ((GraphLike.this)#NodeT) => U): Unit

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

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

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  179. def withTargets[U](f: ((GraphLike.this)#NodeT) => U): Unit

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

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

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#NodeT] performed by method toEdge in scalax.collection.GraphPredef.InnerEdgeParam.
    Definition Classes
    EdgeLike
  180. def zip[B](that: scala.collection.IterableOnce[B]): Iterable[((GraphLike.this)#NodeT, B)]
    Definition Classes
    IterableOps
  181. def zipAll[A1 >: (GraphLike.this)#NodeT, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
    Definition Classes
    IterableOps
  182. def zipWithIndex: Iterable[((GraphLike.this)#NodeT, Int)]
    Definition Classes
    IterableOps → IterableOnceOps
  183. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toEdgeAssoc[(GraphLike.this)#InnerEdge] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  184. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toEdgeAssoc[(GraphLike.this)#InnerEdge] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  185. final def ~~: Set[(GraphLike.this)#EdgeT]

    Synonym for adjacents.

    Synonym for adjacents.

    Definition Classes
    InnerEdge
    Annotations
    @inline()

Shadowed Implicit Value Members

  1. final def ++[B >: (GraphLike.this)#NodeT](suffix: scala.collection.IterableOnce[B]): Iterable[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).++(suffix)
    Definition Classes
    IterableOps
    Annotations
    @inline()
  2. final def addString(b: StringBuilder): StringBuilder
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).addString(b)
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  3. final def addString(b: StringBuilder, sep: String): StringBuilder
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).addString(b, sep)
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  4. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).addString(b, start, sep, end)
    Definition Classes
    IterableOnceOps
  5. def collect[B](pf: PartialFunction[(GraphLike.this)#NodeT, B]): Iterable[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).collect(pf)
    Definition Classes
    IterableOps → IterableOnceOps
  6. def collectFirst[B](pf: PartialFunction[(GraphLike.this)#NodeT, B]): Option[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).collectFirst(pf)
    Definition Classes
    IterableOnceOps
  7. def concat[B >: (GraphLike.this)#NodeT](suffix: scala.collection.IterableOnce[B]): Iterable[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).concat(suffix)
    Definition Classes
    IterableOps
  8. def copyToArray[B >: (GraphLike.this)#NodeT](xs: Array[B], start: Int, len: Int): Int
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).copyToArray(xs, start, len)
    Definition Classes
    IterableOnceOps
  9. def copyToArray[B >: (GraphLike.this)#NodeT](xs: Array[B], start: Int): Int
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).copyToArray(xs, start)
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  10. def copyToArray[B >: (GraphLike.this)#NodeT](xs: Array[B]): Int
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).copyToArray(xs)
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  11. def corresponds[B](that: scala.collection.IterableOnce[B])(p: ((GraphLike.this)#NodeT, B) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).corresponds(that)(p)
    Definition Classes
    IterableOnceOps
  12. def count(p: ((GraphLike.this)#NodeT) => Boolean): Int
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).count(p)
    Definition Classes
    IterableOnceOps
  13. def drop(n: Int): Iterable[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).drop(n)
    Definition Classes
    IterableOps → IterableOnceOps
  14. def dropRight(n: Int): Iterable[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).dropRight(n)
    Definition Classes
    IterableOps
  15. def dropWhile(p: ((GraphLike.this)#NodeT) => Boolean): Iterable[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).dropWhile(p)
    Definition Classes
    IterableOps → IterableOnceOps
  16. def edge: EdgeLike[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).edge
    Definition Classes
    OuterEdge
  17. def empty: Iterable[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).empty
    Definition Classes
    IterableFactoryDefaults → IterableOps
  18. def equals(other: Any): Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).equals(other)
    Definition Classes
    EdgeLike → AnyRef → Any
  19. def exists(p: ((GraphLike.this)#NodeT) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).exists(p)
    Definition Classes
    IterableOnceOps
  20. def filter(pred: ((GraphLike.this)#NodeT) => Boolean): Iterable[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).filter(pred)
    Definition Classes
    IterableOps → IterableOnceOps
  21. def filterNot(pred: ((GraphLike.this)#NodeT) => Boolean): Iterable[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).filterNot(pred)
    Definition Classes
    IterableOps → IterableOnceOps
  22. def find(p: ((GraphLike.this)#NodeT) => Boolean): Option[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).find(p)
    Definition Classes
    IterableOnceOps
  23. def flatMap[B](f: ((GraphLike.this)#NodeT) => scala.collection.IterableOnce[B]): Iterable[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).flatMap(f)
    Definition Classes
    IterableOps → IterableOnceOps
  24. def flatten[B](implicit asIterable: ((GraphLike.this)#NodeT) => scala.collection.IterableOnce[B]): Iterable[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).flatten(asIterable)
    Definition Classes
    IterableOps → IterableOnceOps
  25. def fold[A1 >: (GraphLike.this)#NodeT](z: A1)(op: (A1, A1) => A1): A1
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).fold(z)(op)
    Definition Classes
    IterableOnceOps
  26. def foldLeft[B](z: B)(op: (B, (GraphLike.this)#NodeT) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).foldLeft(z)(op)
    Definition Classes
    IterableOnceOps
  27. def foldRight[B](z: B)(op: ((GraphLike.this)#NodeT, B) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).foldRight(z)(op)
    Definition Classes
    IterableOnceOps
  28. def forall(p: ((GraphLike.this)#NodeT) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).forall(p)
    Definition Classes
    IterableOnceOps
  29. def foreach[U](f: ((GraphLike.this)#NodeT) => U): Unit
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).foreach(f)
    Definition Classes
    IterableOnceOps
  30. def groupBy[K](f: ((GraphLike.this)#NodeT) => K): Map[K, Iterable[(GraphLike.this)#NodeT]]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).groupBy(f)
    Definition Classes
    IterableOps
  31. def groupMap[K, B](key: ((GraphLike.this)#NodeT) => K)(f: ((GraphLike.this)#NodeT) => B): Map[K, Iterable[B]]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).groupMap(key)(f)
    Definition Classes
    IterableOps
  32. def groupMapReduce[K, B](key: ((GraphLike.this)#NodeT) => K)(f: ((GraphLike.this)#NodeT) => B)(reduce: (B, B) => B): Map[K, B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).groupMapReduce(key)(f)(reduce)
    Definition Classes
    IterableOps
  33. def grouped(size: Int): Iterator[Iterable[(GraphLike.this)#NodeT]]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).grouped(size)
    Definition Classes
    IterableOps
  34. def hashCode(): Int
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).hashCode()
    Definition Classes
    EdgeLike → AnyRef → Any
  35. def head: (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).head
    Definition Classes
    IterableOps
  36. def headOption: Option[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).headOption
    Definition Classes
    IterableOps
  37. def init: Iterable[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).init
    Definition Classes
    IterableOps
  38. def inits: Iterator[Iterable[(GraphLike.this)#NodeT]]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).inits
    Definition Classes
    IterableOps
  39. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toOuterNode[(GraphLike.this)#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[(GraphLike.this)#InnerEdge]).isDefined
    Definition Classes
    Param
  40. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).isDefined
    Definition Classes
    Param
  41. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toOuterNode[(GraphLike.this)#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[(GraphLike.this)#InnerEdge]).isEdge
    Definition Classes
    Param
  42. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).isEdge
    Definition Classes
    Param
  43. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).isEmpty
    Definition Classes
    IterableOnceOps
  44. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toOuterNode[(GraphLike.this)#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[(GraphLike.this)#InnerEdge]).isIn
    Definition Classes
    InParam → Param
  45. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).isIn
    Definition Classes
    InParam → Param
  46. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toOuterNode[(GraphLike.this)#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[(GraphLike.this)#InnerEdge]).isNode
    Definition Classes
    NodeParam
  47. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).isNode
    Definition Classes
    EdgeParam
  48. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toOuterNode[(GraphLike.this)#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[(GraphLike.this)#InnerEdge]).isOut
    Definition Classes
    Param
  49. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).isOut
    Definition Classes
    Param
  50. def isTraversableAgain: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).isTraversableAgain
    Definition Classes
    IterableOps → IterableOnceOps
  51. def iterableFactory: IterableFactory[Iterable]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).iterableFactory
    Definition Classes
    Iterable → IterableOps
  52. def iterator: Iterator[(GraphLike.this)#NodeT]

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

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

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).iterator
    Definition Classes
    EdgeLike → IterableOnce
  53. def knownSize: Int
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).knownSize
    Definition Classes
    IterableOnce
  54. def last: (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).last
    Definition Classes
    IterableOps
  55. def lastOption: Option[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).lastOption
    Definition Classes
    IterableOps
  56. def lazyZip[B]: ([B](that: Iterable[B]): scala.collection.LazyZip2[GraphLike.this.NodeT,B,_1.type]) forSome {val _1: E[(GraphLike.this)#NodeT]}
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).lazyZip
    Definition Classes
    Iterable
  57. def map[B](f: ((GraphLike.this)#NodeT) => B): Iterable[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).map(f)
    Definition Classes
    IterableOps → IterableOnceOps
  58. def max[B >: (GraphLike.this)#NodeT](implicit ord: Ordering[B]): (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).max(ord)
    Definition Classes
    IterableOnceOps
  59. def maxBy[B](f: ((GraphLike.this)#NodeT) => B)(implicit cmp: Ordering[B]): (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).maxBy(f)(cmp)
    Definition Classes
    IterableOnceOps
  60. def maxByOption[B](f: ((GraphLike.this)#NodeT) => B)(implicit cmp: Ordering[B]): Option[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).maxByOption(f)(cmp)
    Definition Classes
    IterableOnceOps
  61. def maxOption[B >: (GraphLike.this)#NodeT](implicit ord: Ordering[B]): Option[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).maxOption(ord)
    Definition Classes
    IterableOnceOps
  62. def min[B >: (GraphLike.this)#NodeT](implicit ord: Ordering[B]): (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).min(ord)
    Definition Classes
    IterableOnceOps
  63. def minBy[B](f: ((GraphLike.this)#NodeT) => B)(implicit cmp: Ordering[B]): (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).minBy(f)(cmp)
    Definition Classes
    IterableOnceOps
  64. def minByOption[B](f: ((GraphLike.this)#NodeT) => B)(implicit cmp: Ordering[B]): Option[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).minByOption(f)(cmp)
    Definition Classes
    IterableOnceOps
  65. def minOption[B >: (GraphLike.this)#NodeT](implicit ord: Ordering[B]): Option[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).minOption(ord)
    Definition Classes
    IterableOnceOps
  66. final def mkString: String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).mkString
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  67. final def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).mkString(sep)
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  68. final def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).mkString(start, sep, end)
    Definition Classes
    IterableOnceOps
  69. def nodes: Product

    The end nodes joined by this edge.

    The end nodes joined by this edge.

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

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).nodes
    Definition Classes
    EdgeLike
  70. def nonEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).nonEmpty
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecatedOverriding()
  71. def partition(p: ((GraphLike.this)#NodeT) => Boolean): (Iterable[(GraphLike.this)#NodeT], Iterable[(GraphLike.this)#NodeT])
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).partition(p)
    Definition Classes
    IterableOps
  72. def partitionMap[A1, A2](f: ((GraphLike.this)#NodeT) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).partitionMap(f)
    Definition Classes
    IterableOps
  73. def product[B >: (GraphLike.this)#NodeT](implicit num: Numeric[B]): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).product(num)
    Definition Classes
    IterableOnceOps
  74. def reduce[B >: (GraphLike.this)#NodeT](op: (B, B) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).reduce(op)
    Definition Classes
    IterableOnceOps
  75. def reduceLeft[B >: (GraphLike.this)#NodeT](op: (B, (GraphLike.this)#NodeT) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).reduceLeft(op)
    Definition Classes
    IterableOnceOps
  76. def reduceLeftOption[B >: (GraphLike.this)#NodeT](op: (B, (GraphLike.this)#NodeT) => B): Option[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).reduceLeftOption(op)
    Definition Classes
    IterableOnceOps
  77. def reduceOption[B >: (GraphLike.this)#NodeT](op: (B, B) => B): Option[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).reduceOption(op)
    Definition Classes
    IterableOnceOps
  78. def reduceRight[B >: (GraphLike.this)#NodeT](op: ((GraphLike.this)#NodeT, B) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).reduceRight(op)
    Definition Classes
    IterableOnceOps
  79. def reduceRightOption[B >: (GraphLike.this)#NodeT](op: ((GraphLike.this)#NodeT, B) => B): Option[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).reduceRightOption(op)
    Definition Classes
    IterableOnceOps
  80. def scan[B >: (GraphLike.this)#NodeT](z: B)(op: (B, B) => B): Iterable[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).scan(z)(op)
    Definition Classes
    IterableOps
  81. def scanLeft[B](z: B)(op: (B, (GraphLike.this)#NodeT) => B): Iterable[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).scanLeft(z)(op)
    Definition Classes
    IterableOps → IterableOnceOps
  82. def scanRight[B](z: B)(op: ((GraphLike.this)#NodeT, B) => B): Iterable[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).scanRight(z)(op)
    Definition Classes
    IterableOps
  83. def size: Int
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).size
    Definition Classes
    IterableOnceOps
  84. def sizeCompare(that: Iterable[_]): Int
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).sizeCompare(that)
    Definition Classes
    IterableOps
  85. def sizeCompare(otherSize: Int): Int
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).sizeCompare(otherSize)
    Definition Classes
    IterableOps
  86. final def sizeIs: SizeCompareOps
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).sizeIs
    Definition Classes
    IterableOps
    Annotations
    @inline()
  87. def slice(from: Int, until: Int): Iterable[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).slice(from, until)
    Definition Classes
    IterableOps → IterableOnceOps
  88. def sliding(size: Int, step: Int): Iterator[Iterable[(GraphLike.this)#NodeT]]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).sliding(size, step)
    Definition Classes
    IterableOps
  89. def sliding(size: Int): Iterator[Iterable[(GraphLike.this)#NodeT]]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).sliding(size)
    Definition Classes
    IterableOps
  90. def span(p: ((GraphLike.this)#NodeT) => Boolean): (Iterable[(GraphLike.this)#NodeT], Iterable[(GraphLike.this)#NodeT])
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).span(p)
    Definition Classes
    IterableOps → IterableOnceOps
  91. def splitAt(n: Int): (Iterable[(GraphLike.this)#NodeT], Iterable[(GraphLike.this)#NodeT])
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).splitAt(n)
    Definition Classes
    IterableOps → IterableOnceOps
  92. def stepper[S <: Stepper[_]](implicit shape: StepperShape[(GraphLike.this)#NodeT, S]): S
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).stepper(shape)
    Definition Classes
    IterableOnce
  93. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toOuterNode[(GraphLike.this)#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[(GraphLike.this)#InnerEdge]).stringPrefix
    Definition Classes
    NodeParam
  94. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).stringPrefix
    Definition Classes
    EdgeLike → Iterable
  95. def sum[B >: (GraphLike.this)#NodeT](implicit num: Numeric[B]): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).sum(num)
    Definition Classes
    IterableOnceOps
  96. def tail: Iterable[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).tail
    Definition Classes
    IterableOps
  97. def tails: Iterator[Iterable[(GraphLike.this)#NodeT]]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).tails
    Definition Classes
    IterableOps
  98. def take(n: Int): Iterable[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).take(n)
    Definition Classes
    IterableOps → IterableOnceOps
  99. def takeRight(n: Int): Iterable[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).takeRight(n)
    Definition Classes
    IterableOps
  100. def takeWhile(p: ((GraphLike.this)#NodeT) => Boolean): Iterable[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).takeWhile(p)
    Definition Classes
    IterableOps → IterableOnceOps
  101. def tapEach[U](f: ((GraphLike.this)#NodeT) => U): Iterable[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).tapEach(f)
    Definition Classes
    IterableOps → IterableOnceOps
  102. def to[C1](factory: Factory[(GraphLike.this)#NodeT, C1]): C1
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).to(factory)
    Definition Classes
    IterableOnceOps
  103. def toArray[B >: (GraphLike.this)#NodeT](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).toArray(arg0)
    Definition Classes
    IterableOnceOps
  104. final def toBuffer[B >: (GraphLike.this)#NodeT]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).toBuffer
    Definition Classes
    IterableOnceOps
    Annotations
    @inline()
  105. def toIndexedSeq: IndexedSeq[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).toIndexedSeq
    Definition Classes
    IterableOnceOps
  106. def toList: List[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).toList
    Definition Classes
    IterableOnceOps
  107. def toMap[K, V](implicit ev: <:<[(GraphLike.this)#NodeT, (K, V)]): Map[K, V]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).toMap(ev)
    Definition Classes
    IterableOnceOps
  108. def toSeq: Seq[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).toSeq
    Definition Classes
    IterableOnceOps
  109. def toSet[B >: (GraphLike.this)#NodeT]: Set[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).toSet
    Definition Classes
    IterableOnceOps
  110. def toString(): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toOuterNode[(GraphLike.this)#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[(GraphLike.this)#InnerEdge]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  111. def toString(): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).toString()
    Definition Classes
    EdgeLike → Iterable → AnyRef → Any
  112. def toVector: Vector[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).toVector
    Definition Classes
    IterableOnceOps
  113. def transpose[B](implicit asIterable: ((GraphLike.this)#NodeT) => Iterable[B]): Iterable[Iterable[B]]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).transpose(asIterable)
    Definition Classes
    IterableOps
  114. def unzip[A1, A2](implicit asPair: ((GraphLike.this)#NodeT) => (A1, A2)): (Iterable[A1], Iterable[A2])
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).unzip(asPair)
    Definition Classes
    IterableOps
  115. def unzip3[A1, A2, A3](implicit asTriple: ((GraphLike.this)#NodeT) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).unzip3(asTriple)
    Definition Classes
    IterableOps
  116. def view: View[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).view
    Definition Classes
    IterableOps
  117. def withFilter(p: ((GraphLike.this)#NodeT) => Boolean): WithFilter[(GraphLike.this)#NodeT, Iterable]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).withFilter(p)
    Definition Classes
    IterableOps
  118. def zip[B](that: scala.collection.IterableOnce[B]): Iterable[((GraphLike.this)#NodeT, B)]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).zip(that)
    Definition Classes
    IterableOps
  119. def zipAll[A1 >: (GraphLike.this)#NodeT, B](that: Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).zipAll(that, thisElem, thatElem)
    Definition Classes
    IterableOps
  120. def zipWithIndex: Iterable[((GraphLike.this)#NodeT, Int)]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).zipWithIndex
    Definition Classes
    IterableOps → IterableOnceOps

Deprecated Value Members

  1. def ++:[B >: (GraphLike.this)#NodeT](that: scala.collection.IterableOnce[B]): Iterable[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).++:(that)
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

  2. def ++:[B >: (GraphLike.this)#NodeT](that: scala.collection.IterableOnce[B]): Iterable[B]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use ++ instead of ++: for collections of type Iterable

  3. def /:[B](z: B)(op: (B, (GraphLike.this)#NodeT) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT])./:(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  4. final def /:[B](z: B)(op: (B, (GraphLike.this)#NodeT) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT])./:(z)(op)
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  5. final def /:[B](z: B)(op: (B, (GraphLike.this)#NodeT) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldLeft instead of /:

  6. def :\[B](z: B)(op: ((GraphLike.this)#NodeT, B) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).:\(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  7. final def :\[B](z: B)(op: ((GraphLike.this)#NodeT, B) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).:\(z)(op)
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  8. final def :\[B](z: B)(op: ((GraphLike.this)#NodeT, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use foldRight instead of :\

  9. def aggregate[B](z: => B)(seqop: (B, (GraphLike.this)#NodeT) => B, combop: (B, B) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).aggregate(z)(seqop, combop)
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  10. def aggregate[B](z: => B)(seqop: (B, (GraphLike.this)#NodeT) => B, combop: (B, B) => B): B
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) aggregate is not relevant for sequential collections. Use foldLeft(z)(seqop) instead.

  11. def collectFirst[B](f: PartialFunction[(GraphLike.this)#NodeT, B]): Option[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).collectFirst(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.collectFirst(...) instead

  12. def companion: IterableFactory[Iterable]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).companion
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding() @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  13. def companion: IterableFactory[Iterable]
    Definition Classes
    IterableOps
    Annotations
    @deprecated @deprecatedOverriding() @inline()
    Deprecated

    (Since version 2.13.0) Use iterableFactory instead

  14. def copyToBuffer(dest: Buffer[(GraphLike.this)#NodeT]): Unit
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).copyToBuffer(dest)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.copyToBuffer(...) instead

  15. final def copyToBuffer[B >: (GraphLike.this)#NodeT](dest: Buffer[B]): Unit
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).copyToBuffer(dest)
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  16. final def copyToBuffer[B >: (GraphLike.this)#NodeT](dest: Buffer[B]): Unit
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use dest ++= coll instead

  17. def count(f: ((GraphLike.this)#NodeT) => Boolean): Int
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).count(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.count(...) instead

  18. def exists(f: ((GraphLike.this)#NodeT) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).exists(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.exists(...) instead

  19. def filter(f: ((GraphLike.this)#NodeT) => Boolean): Iterator[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).filter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.filter(...) instead

  20. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  21. def find(p: ((GraphLike.this)#NodeT) => Boolean): Option[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).find(p)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.find instead

  22. def flatMap[B](f: ((GraphLike.this)#NodeT) => scala.collection.IterableOnce[B]): scala.collection.IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).flatMap(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.flatMap instead or consider requiring an Iterable

  23. def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).fold(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.fold instead

  24. def foldLeft[B](z: B)(op: (B, (GraphLike.this)#NodeT) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).foldLeft(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldLeft instead

  25. def foldRight[B](z: B)(op: ((GraphLike.this)#NodeT, B) => B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).foldRight(z)(op)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foldRight instead

  26. def forall(f: ((GraphLike.this)#NodeT) => Boolean): Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).forall(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.forall(...) instead

  27. def foreach[U](f: ((GraphLike.this)#NodeT) => U): Unit
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).foreach(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.foreach(...) instead

  28. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toStringFormat[(GraphLike.this)#InnerEdge] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.12.16) Use formatString.format(value) instead of value.formatted(formatString), or use the f"" string interpolator. In Java 15 and later, formatted resolves to the new method in String which has reversed parameters.

  29. def hasDefiniteSize: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).hasDefiniteSize
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

  30. def hasDefiniteSize: Boolean
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)

  31. def isEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).isEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.isEmpty instead

  32. def map[B](f: ((GraphLike.this)#NodeT) => B): scala.collection.IterableOnce[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).map(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.map instead or consider requiring an Iterable

  33. def max(implicit ord: Ordering[(GraphLike.this)#NodeT]): (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).max(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.max instead

  34. def maxBy[B](f: ((GraphLike.this)#NodeT) => B)(implicit cmp: Ordering[B]): (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).maxBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.maxBy(...) instead

  35. def min(implicit ord: Ordering[(GraphLike.this)#NodeT]): (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).min(ord)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.min instead

  36. def minBy[B](f: ((GraphLike.this)#NodeT) => B)(implicit cmp: Ordering[B]): (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).minBy(f)(cmp)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.minBy(...) instead

  37. def mkString: String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).mkString
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  38. def mkString(sep: String): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).mkString(sep)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  39. def mkString(start: String, sep: String, end: String): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).mkString(start, sep, end)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.mkString instead

  40. def nonEmpty: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).nonEmpty
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.nonEmpty instead

  41. def product(implicit num: Numeric[(GraphLike.this)#NodeT]): (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).product(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.product instead

  42. def reduce(f: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) => (GraphLike.this)#NodeT): (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).reduce(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduce(...) instead

  43. def reduceLeft(f: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) => (GraphLike.this)#NodeT): (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).reduceLeft(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceLeft(...) instead

  44. def reduceLeftOption(f: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) => (GraphLike.this)#NodeT): Option[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).reduceLeftOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceLeftOption(...) instead

  45. def reduceOption(f: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) => (GraphLike.this)#NodeT): Option[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).reduceOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceOption(...) instead

  46. def reduceRight(f: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) => (GraphLike.this)#NodeT): (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).reduceRight(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceRight(...) instead

  47. def reduceRightOption(f: ((GraphLike.this)#NodeT, (GraphLike.this)#NodeT) => (GraphLike.this)#NodeT): Option[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).reduceRightOption(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.reduceRightOption(...) instead

  48. final def repr: Iterable[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).repr
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  49. final def repr: Iterable[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use coll instead of repr in a collection implementation, use the collection value itself from the outside

  50. def sameElements[B >: A](that: scala.collection.IterableOnce[B]): Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sameElements instead

  51. def seq: E[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).seq
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  52. def seq: InnerEdge.this.type
    Definition Classes
    Iterable
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Iterable.seq always returns the iterable itself

  53. def size: Int
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).size
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.size instead

  54. def sum(implicit num: Numeric[(GraphLike.this)#NodeT]): (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).sum(num)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.sum instead

  55. def to[C1](factory: Factory[(GraphLike.this)#NodeT, C1]): C1
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).to(factory)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(factory) instead

  56. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toArray(arg0)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toArray

  57. def toBuffer[B >: A]: Buffer[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toBuffer
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(ArrayBuffer) instead

  58. def toEdgeIn: E[N]
    Definition Classes
    InnerEdge
    Annotations
    @deprecated
    Deprecated

    (Since version 1.8.0) Use toOuter instead

  59. def toIndexedSeq: IndexedSeq[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toIndexedSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.toIndexedSeq instead

  60. final def toIterable: Iterable[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toIterable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Iterable) instead

  61. final def toIterable: E[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).toIterable
    Definition Classes
    Iterable → IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  62. final def toIterable: InnerEdge.this.type
    Definition Classes
    Iterable → IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.7) toIterable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  63. def toIterator: Iterator[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toIterator
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead

  64. final def toIterator: Iterator[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).toIterator
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  65. final def toIterator: Iterator[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator instead of .toIterator

  66. def toList: List[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toList
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(List) instead

  67. def toMap[K, V](implicit ev: <:<[(GraphLike.this)#NodeT, (K, V)]): Map[K, V]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toMap(ev)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Map) instead

  68. def toSeq: Seq[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toSeq
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Seq) instead

  69. def toSet[B >: A]: Set[B]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toSet
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Set) instead

  70. def toStream: Stream[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toStream
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(LazyList) instead

  71. final def toStream: Stream[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).toStream
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  72. final def toStream: Stream[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOnceOps
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .to(LazyList) instead of .toStream

  73. final def toTraversable: Traversable[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toTraversable
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Iterable) instead

  74. final def toTraversable: Traversable[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).toTraversable
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  75. final def toTraversable: Traversable[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) toTraversable is internal and will be made protected; its name is similar to toList or toSeq, but it doesn't copy non-immutable collections

  76. def toVector: Vector[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).toVector
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.13.0) Use .iterator.to(Vector) instead

  77. def view(from: Int, until: Int): View[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toE[(GraphLike.this)#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[(GraphLike.this)#NodeT]).view(from, until)
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

  78. def view(from: Int, until: Int): View[(GraphLike.this)#NodeT]
    Definition Classes
    IterableOps
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .view.slice(from, until) instead of .view(from, until)

  79. def withFilter(f: ((GraphLike.this)#NodeT) => Boolean): Iterator[(GraphLike.this)#NodeT]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toIterableOnceExtensionMethods[(GraphLike.this)#NodeT] performed by method iterableOnceExtensionMethods in scala.collection.IterableOnce.
    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: IterableOnceExtensionMethods[(GraphLike.this)#NodeT]).withFilter(f)
    Definition Classes
    IterableOnceExtensionMethods
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use .iterator.withFilter(...) instead

  80. def →[B](y: B): ((GraphLike.this)#InnerEdge, B)
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerEdge toArrowAssoc[(GraphLike.this)#InnerEdge] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Inherited from (GraphLike.this)#InnerEdge

Inherited from (GraphLike.this)#InnerElem

Inherited from (GraphLike.this)#Edge

Inherited from Serializable

Inherited from InnerEdgeParam[N, E, (GraphLike.this)#NodeT, E]

Inherited from EdgeParam

Inherited from OutParam[N, E]

Inherited from Param[N, E]

Inherited from Iterable[(GraphLike.this)#NodeT]

Inherited from IterableFactoryDefaults[(GraphLike.this)#NodeT, Iterable]

Inherited from IterableOps[(GraphLike.this)#NodeT, Iterable, Iterable[(GraphLike.this)#NodeT]]

Inherited from IterableOnceOps[(GraphLike.this)#NodeT, Iterable, Iterable[(GraphLike.this)#NodeT]]

Inherited from scala.collection.IterableOnce[(GraphLike.this)#NodeT]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion iterableOnceExtensionMethods from(GraphLike.this)#InnerEdge to IterableOnceExtensionMethods[(GraphLike.this)#NodeT]

Inherited by implicit conversion EdgeAssoc from(GraphLike.this)#InnerEdge to EdgeAssoc[(GraphLike.this)#InnerEdge]

Inherited by implicit conversion TraversableEnrichments from(GraphLike.this)#InnerEdge to TraversableEnrichments[(GraphLike.this)#NodeT, Iterable]

Inherited by implicit conversion anyToNode from(GraphLike.this)#InnerEdge to OuterNode[(GraphLike.this)#InnerEdge]

Inherited by implicit conversion ChainingOps from(GraphLike.this)#InnerEdge to ChainingOps[(GraphLike.this)#InnerEdge]

Inherited by implicit conversion toEdge from(GraphLike.this)#InnerEdge to E[(GraphLike.this)#NodeT]

Inherited by implicit conversion any2stringadd from(GraphLike.this)#InnerEdge to any2stringadd[(GraphLike.this)#InnerEdge]

Inherited by implicit conversion StringFormat from(GraphLike.this)#InnerEdge to StringFormat[(GraphLike.this)#InnerEdge]

Inherited by implicit conversion Ensuring from(GraphLike.this)#InnerEdge to Ensuring[(GraphLike.this)#InnerEdge]

Inherited by implicit conversion ArrowAssoc from(GraphLike.this)#InnerEdge to ArrowAssoc[(GraphLike.this)#InnerEdge]

Ungrouped