Packages

abstract class WkDiEdge[+N] extends WkUnDiEdge[N] with DiEdgeLike[N] with OuterEdge[N, WkDiEdge] with EqDi

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. WkDiEdge
  2. DiEdgeLike
  3. EqDi
  4. DiHyperEdgeLike
  5. EqDiHyper
  6. WkUnDiEdge
  7. WkEdge
  8. Keyed
  9. WUnDiEdge
  10. WEdge
  11. UnDiEdge
  12. EqUnDi
  13. HyperEdge
  14. EqHyper
  15. OuterEdge
  16. EdgeParam
  17. InParam
  18. Param
  19. EdgeCopy
  20. EdgeLike
  21. Serializable
  22. Serializable
  23. Eq
  24. Iterable
  25. IterableLike
  26. Equals
  27. GenIterable
  28. GenIterableLike
  29. Traversable
  30. GenTraversable
  31. GenericTraversableTemplate
  32. TraversableLike
  33. GenTraversableLike
  34. Parallelizable
  35. TraversableOnce
  36. GenTraversableOnce
  37. FilterMonadic
  38. HasNewBuilder
  39. AnyRef
  40. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by MonadOps
  4. by HyperEdgeAssoc
  5. by EdgeAssoc
  6. by any2stringadd
  7. by StringFormat
  8. by Ensuring
  9. by ArrowAssoc
  10. by alternateImplicit
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new WkDiEdge(nodes: Product, weight: Double)

Type Members

  1. class EdgeException extends Exception
    Attributes
    protected
    Definition Classes
    EdgeLike
  2. type Self = Iterable[N]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  3. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

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 WkDiEdge[N] to any2stringadd[WkDiEdge[N]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ++[B >: N, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  5. def ++:[B >: N, That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike
  6. def ++:[B >: N, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike
  7. def ->[B](y: B): (WkDiEdge[N], B)
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to ArrowAssoc[WkDiEdge[N]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  8. def /:[B](z: B)(op: (B, N) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  9. def :\[B](z: B)(op: (N, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  10. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. final def _1: N

    The first node.

    The first node. Same as _n(0).

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  12. def _2: N

    The second node.

    The second node. Same as _n(1).

    Definition Classes
    EdgeLike
  13. def _n(n: Int): N

    The n'th node with 0 <= n < arity.

    The n'th node with 0 <= n < arity.

    Definition Classes
    EdgeLike
  14. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  15. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  16. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  17. def aggregate[B](z: ⇒ B)(seqop: (B, N) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  18. 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.

    Definition Classes
    EdgeLike
  19. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  20. def attributesToString: String
    Attributes
    protected
    Definition Classes
    WEdge
  21. final def baseEquals(other: EdgeLike[_]): Boolean
    Attributes
    protected
    Definition Classes
    EqDi → Eq
  22. def baseHashCode: Int
    Attributes
    protected
    Definition Classes
    EqDi → Eq
  23. def brackets: Brackets
    Attributes
    protected
    Definition Classes
    EdgeLike
  24. def canEqual(that: Any): Boolean
    Definition Classes
    EdgeLike → IterableLike → Equals
  25. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  26. def collect[B, That](pf: PartialFunction[N, B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  27. def collectFirst[B](pf: PartialFunction[N, B]): Option[B]
    Definition Classes
    TraversableOnce
  28. def companion: GenericCompanion[Iterable]
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  29. final def contains[M >: N](node: M): Boolean

    Same as isAt.

    Same as isAt.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  30. def copy[NN](newNodes: Product): WUnDiEdge[NN]

    It is a prerequisite for edge-classes to implement this method.

    It is a prerequisite for edge-classes to implement this method. Otherwise they cannot be passed to a Graph.

    Graph calls this method internally to obtain a new instance of the edge passed to Graph with nodes of the type of the inner class NodeT which itself contains the outer node.

    Attributes
    protected[scalax.collection]
    Definition Classes
    WUnDiEdge → UnDiEdge → HyperEdge → EdgeCopy
  31. def copyToArray[B >: N](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  32. def copyToArray[B >: N](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def copyToArray[B >: N](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  34. def copyToBuffer[B >: N](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  35. def count(p: (N) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  36. final def diBaseEquals(n1: Any, n2: Any): Boolean
    Attributes
    protected
    Definition Classes
    EqDi
    Annotations
    @inline()
  37. final def directed: Boolean

    true if this edge is directed.

    true if this edge is directed.

    Definition Classes
    DiHyperEdgeLike → EdgeLike
    Annotations
    @inline()
  38. def drop(n: Int): Iterable[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  39. def dropRight(n: Int): Iterable[N]
    Definition Classes
    IterableLike
  40. def dropWhile(p: (N) ⇒ Boolean): Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  41. val e: EdgeLikeIn[N]
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to HyperEdgeAssoc[N] performed by method HyperEdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    HyperEdgeAssoc
  42. def edge: WkDiEdge[N]
    Definition Classes
    OuterEdge
  43. def ensuring(cond: (WkDiEdge[N]) ⇒ Boolean, msg: ⇒ Any): WkDiEdge[N]
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to Ensuring[WkDiEdge[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  44. def ensuring(cond: (WkDiEdge[N]) ⇒ Boolean): WkDiEdge[N]
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to Ensuring[WkDiEdge[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  45. def ensuring(cond: Boolean, msg: ⇒ Any): WkDiEdge[N]
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to Ensuring[WkDiEdge[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  46. def ensuring(cond: Boolean): WkDiEdge[N]
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to Ensuring[WkDiEdge[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  47. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  48. def equals(other: EdgeLike[_]): Boolean
    Attributes
    protected
    Definition Classes
    WkEdge
  49. def equals(other: Any): Boolean
    Definition Classes
    EdgeLike → Equals → AnyRef → Any
  50. def exists(p: (N) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  51. def filter(p: (N) ⇒ Boolean): Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  52. def filterNot(p: (N) ⇒ Boolean): Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  53. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  54. def find(p: (N) ⇒ Boolean): Option[N]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  55. def flatMap[B, That](f: (N) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  56. def flatten[B](implicit asTraversable: (N) ⇒ GenTraversableOnce[B]): Iterable[B]
    Definition Classes
    GenericTraversableTemplate
  57. def fold[A1 >: N](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  58. def foldLeft[B](z: B)(op: (B, N) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  59. def foldRight[B](z: B)(op: (N, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  60. def forall(p: (N) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  61. def foreach[U](f: (N) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  62. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to StringFormat[WkDiEdge[N]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  63. final def from: N

    Synonym for source.

    Synonym for source.

    Definition Classes
    DiHyperEdgeLike
    Annotations
    @inline()
  64. def genericBuilder[B]: Builder[B, Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
  65. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  66. def groupBy[K](f: (N) ⇒ K): Map[K, Iterable[N]]
    Definition Classes
    TraversableLike → GenTraversableLike
  67. def grouped(size: Int): Iterator[Iterable[N]]
    Definition Classes
    IterableLike
  68. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  69. final def hasSource(pred: (N) ⇒ Boolean): Boolean

    true if any source end of this edge fulfills pred.

    true if any source end of this edge fulfills pred.

    Definition Classes
    DiEdgeLike → DiHyperEdgeLike → EdgeLike
  70. final 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.

    Definition Classes
    DiEdgeLike → DiHyperEdgeLike → EdgeLike
  71. final def hasTarget(pred: (N) ⇒ Boolean): Boolean

    true if any target end of this edge fulfills pred.

    true if any target end of this edge fulfills pred.

    Definition Classes
    DiEdgeLike → DiHyperEdgeLike → EdgeLike
  72. final 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.

    Definition Classes
    DiEdgeLike → DiHyperEdgeLike → EdgeLike
  73. def hashCode(): Int
    Definition Classes
    WkEdge → AnyRef → Any
  74. def head: N
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  75. def headOption: Option[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  76. def init: Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  77. def inits: Iterator[Iterable[N]]
    Definition Classes
    TraversableLike
  78. def isAt(pred: (N) ⇒ Boolean): Boolean

    true if any end of this edge fulfills pred.

    true if any end of this edge fulfills pred.

    Definition Classes
    UnDiEdge → HyperEdge → EdgeLike
  79. def isAt[M >: N](node: M): Boolean

    true if node is incident with this edge.

    true if node is incident with this edge.

    Definition Classes
    UnDiEdge → HyperEdge → EdgeLike
  80. def isDefined: Boolean
    Definition Classes
    Param
  81. final def isDirected: Boolean

    Same as directed.

    Same as directed.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  82. def isEdge: Boolean
    Definition Classes
    EdgeParam
  83. def isEmpty: Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  84. final 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.

    Definition Classes
    UnDiEdge → EdgeLike
    Annotations
    @inline()
  85. def isIn: Boolean
    Definition Classes
    InParam → Param
  86. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  87. def isLabeled: Boolean

    true if this edge is labeled.

    true if this edge is labeled. See also label.

    Definition Classes
    EdgeLike
  88. 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.

    Definition Classes
    EdgeLike
  89. def isNode: Boolean
    Definition Classes
    EdgeParam
  90. def isOut: Boolean
    Definition Classes
    InParam → Param
  91. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  92. final def isUndirected: Boolean

    Same as undirected.

    Same as undirected.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  93. final def isValidArity(size: Int): Boolean

    A function to determine whether the arity of the passed Product of nodes (that is the number of edge ends) is valid.

    A function to determine whether the arity of the passed Product of nodes (that is the number of edge ends) is valid. This function is called on every edge-instantiation by validate that throws EdgeException if this method returns false.

    Attributes
    protected
    Definition Classes
    UnDiEdge → HyperEdge → EdgeLike
    Annotations
    @inline()
  94. def isValidCustom: Boolean

    This method may be overridden to enforce additional validation at edge creation time.

    This method may be overridden to enforce additional validation at edge creation time. Be careful to call super.isValidCustom when overriding. This function is called on every edge-instantiation by validate that throws EdgeException if this method returns false.

    Attributes
    protected
    Definition Classes
    EdgeLike
  95. def isValidCustomExceptionMessage: String
    Attributes
    protected
    Definition Classes
    EdgeLike
  96. def iterator: Iterator[N]

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

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

    Definition Classes
    UnDiEdge → HyperEdge → EdgeLike → IterableLike → GenIterableLike
  97. 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.

    Definition Classes
    EdgeLike
    Exceptions thrown

    UnsupportedOperationException if the edge is non-labeled.

  98. def last: N
    Definition Classes
    TraversableLike → GenTraversableLike
  99. def lastOption: Option[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  100. def map[B, That](f: (N) ⇒ B)(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  101. def matches(p1: (N) ⇒ Boolean, p2: (N) ⇒ 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.

    Definition Classes
    DiEdgeLike → DiHyperEdgeLike → EdgeLike
  102. 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.

    Definition Classes
    DiEdgeLike → DiHyperEdgeLike → EdgeLike
  103. final def matches(fList: List[(N) ⇒ Boolean]): Boolean
    Attributes
    protected
    Definition Classes
    HyperEdge
  104. def max[B >: N](implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. def maxBy[B](f: (N) ⇒ B)(implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. def min[B >: N](implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  107. def minBy[B](f: (N) ⇒ B)(implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  108. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  109. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. val n1: WkDiEdge[N]
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to EdgeAssoc[WkDiEdge[N]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  112. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  113. def newBuilder: Builder[N, Iterable[N]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  114. def nodeSeq: Seq[N]

    Sequence of the end points of this edge.

    Sequence of the end points of this edge.

    Definition Classes
    EdgeLike
  115. val 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.

    Definition Classes
    HyperEdge → EdgeLike
  116. def nodesToString: String
    Attributes
    protected
    Definition Classes
    EdgeLike
  117. def nodesToStringSeparator: String
    Attributes
    protected
    Definition Classes
    DiHyperEdgeLike → EdgeLike
  118. def nodesToStringWithParenthesis: Boolean
    Attributes
    protected
    Definition Classes
    EdgeLike
  119. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  120. final def nonHyperEdge: Boolean

    true if this edge has exactly two ends.

    true if this edge has exactly two ends.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  121. final def nonLooping: Boolean

    Same as ! looping.

    Same as ! looping.

    Definition Classes
    EdgeLike
  122. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  123. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  124. def par: ParIterable[N]
    Definition Classes
    Parallelizable
  125. def parCombiner: Combiner[N, ParIterable[N]]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  126. def partition(p: (N) ⇒ Boolean): (Iterable[N], Iterable[N])
    Definition Classes
    TraversableLike → GenTraversableLike
  127. def product[B >: N](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  128. def reduce[A1 >: N](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  129. def reduceLeft[B >: N](op: (B, N) ⇒ B): B
    Definition Classes
    TraversableOnce
  130. def reduceLeftOption[B >: N](op: (B, N) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  131. def reduceOption[A1 >: N](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  132. def reduceRight[B >: N](op: (N, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  133. def reduceRightOption[B >: N](op: (N, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  134. def repr: Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  135. def reversed: List[N]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  136. def sameElements[B >: N](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  137. def scan[B >: N, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  138. def scanLeft[B, That](z: B)(op: (B, N) ⇒ B)(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  139. def scanRight[B, That](z: B)(op: (N, B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

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

  140. def seq: Iterable[N]
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  141. final def size: Int
    Definition Classes
    UnDiEdge → GenTraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @inline()
  142. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  143. def slice(from: Int, until: Int): Iterable[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  144. def sliding(size: Int, step: Int): Iterator[Iterable[N]]
    Definition Classes
    IterableLike
  145. def sliding(size: Int): Iterator[Iterable[N]]
    Definition Classes
    IterableLike
  146. final def source: N

    The single source node of this directed edge.

    The single source node of this directed edge.

    Definition Classes
    DiHyperEdgeLike
    Annotations
    @inline()
  147. def sources: Traversable[N]

    All source ends of this edge.

    All source ends of this edge.

    Definition Classes
    EdgeLike
  148. def span(p: (N) ⇒ Boolean): (Iterable[N], Iterable[N])
    Definition Classes
    TraversableLike → GenTraversableLike
  149. def splitAt(n: Int): (Iterable[N], Iterable[N])
    Definition Classes
    TraversableLike → GenTraversableLike
  150. def stringPrefix: String
    Definition Classes
    EdgeLike → TraversableLike → GenTraversableLike
  151. def sum[B >: N](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  152. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  153. def tail: Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  154. def tails: Iterator[Iterable[N]]
    Definition Classes
    TraversableLike
  155. def take(n: Int): Iterable[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  156. def takeRight(n: Int): Iterable[N]
    Definition Classes
    IterableLike
  157. def takeWhile(p: (N) ⇒ Boolean): Iterable[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  158. final def target: N

    The target node for a directed edge; one of the target nodes for a directed hyperedge.

    The target node for a directed edge; one of the target nodes for a directed hyperedge.

    Definition Classes
    DiHyperEdgeLike
    Annotations
    @inline()
  159. def targets: Traversable[N]

    All target ends of this edge.

    All target ends of this edge.

    Definition Classes
    EdgeLike
  160. def thisCollection: Iterable[N]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  161. final def thisSimpleClassName: String
    Attributes
    protected
    Definition Classes
    EdgeLike
  162. final def to: N

    Synonym for target.

    Synonym for target.

    Definition Classes
    DiEdgeLike → DiHyperEdgeLike
    Annotations
    @inline()
  163. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, N, Col[N]]): Col[N]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  164. def toArray[B >: N](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  165. def toBuffer[B >: N]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  166. def toCollection(repr: Iterable[N]): Iterable[N]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  167. def toIndexedSeq: IndexedSeq[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  168. def toIterable: Iterable[N]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  169. def toIterator: Iterator[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  170. def toList: List[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  171. def toMap[T, U](implicit ev: <:<[N, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  172. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to CollectionsHaveToParArray[WkDiEdge[N], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (WkDiEdge[N]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  173. def toSeq: Seq[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  174. def toSet[B >: N]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  175. def toStream: Stream[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  176. def toString(): String
    Definition Classes
    EdgeLike → TraversableLike → AnyRef → Any
  177. def toStringWithParenthesis: Boolean
    Attributes
    protected
    Definition Classes
    EdgeLike
  178. def toTraversable: Traversable[N]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  179. def toVector: Vector[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  180. def transpose[B](implicit asTraversable: (N) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  181. final def unDiBaseEquals(n1: Any, n2: Any): Boolean
    Attributes
    protected
    Definition Classes
    EqUnDi
    Annotations
    @inline()
  182. final def undirected: Boolean

    true if this edge is undirected.

    true if this edge is undirected.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  183. def unzip[A1, A2](implicit asPair: (N) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    GenericTraversableTemplate
  184. def unzip3[A1, A2, A3](implicit asTriple: (N) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    GenericTraversableTemplate
  185. final def validate: Unit

    Performs basic, inevitable edge validation.

    Performs basic, inevitable edge validation. Among others, ensures that nodes ne null and no edge end eq null.

    This validation method must be called in the constructor of any edge class that directly extends or mixes in EdgeLike. To perform additional custom validation isValidCustom is to be overridden.

    Attributes
    protected
    Definition Classes
    EdgeLike
    Exceptions thrown

    EdgeException if any of the basic validations or of eventually supplied additional validations fails.

  186. val value: WkDiEdge[N]
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to OuterNode[WkDiEdge[N]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNode → NodeParam
  187. def view(from: Int, until: Int): IterableView[N, Iterable[N]]
    Definition Classes
    IterableLike → TraversableLike
  188. def view: IterableView[N, Iterable[N]]
    Definition Classes
    IterableLike → TraversableLike
  189. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  190. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  191. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  192. val 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.

    For weight types other than Long you may either convert then to Long prior to edge creation or define a custom edge class that includes the weight of the appropriate type and overrides def weight to provide the required conversion to Long.

    Definition Classes
    WUnDiEdge → EdgeLike
  193. def withFilter(p: (N) ⇒ Boolean): FilterMonadic[N, Iterable[N]]
    Definition Classes
    TraversableLike → FilterMonadic
  194. final def withSources[U](f: (N) ⇒ U): Unit

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

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

    Definition Classes
    DiEdgeLike → DiHyperEdgeLike → EdgeLike
  195. final def withTargets[U](f: (N) ⇒ U): Unit

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

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

    Definition Classes
    DiEdgeLike → DiHyperEdgeLike → EdgeLike
  196. def zip[A1 >: N, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[N], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  197. def zipAll[B, A1 >: N, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[N], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  198. def zipWithIndex[A1 >: N, That](implicit bf: CanBuildFrom[Iterable[N], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  199. def ~[N >: NOld](n: N)(implicit endpointsKind: CollectionKind = Bag): HyperEdge[N]
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to HyperEdgeAssoc[N] performed by method HyperEdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    HyperEdgeAssoc
  200. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to EdgeAssoc[WkDiEdge[N]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  201. def ~>[N >: NOld](n: N)(implicit targetsKind: CollectionKind = Bag): DiHyperEdge[N]
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to HyperEdgeAssoc[N] performed by method HyperEdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    HyperEdgeAssoc
  202. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to EdgeAssoc[WkDiEdge[N]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  203. def →[B](y: B): (WkDiEdge[N], B)
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to ArrowAssoc[WkDiEdge[N]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def filter(p: (N) ⇒ Boolean): TraversableOnce[N]
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to MonadOps[N] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (wkDiEdge: MonadOps[N]).filter(p)
    Definition Classes
    MonadOps
  2. def flatMap[B](f: (N) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to MonadOps[N] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (wkDiEdge: MonadOps[N]).flatMap(f)
    Definition Classes
    MonadOps
  3. def isDefined: Boolean
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to OuterNode[WkDiEdge[N]] 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:
    (wkDiEdge: OuterNode[WkDiEdge[N]]).isDefined
    Definition Classes
    Param
  4. def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to OuterNode[WkDiEdge[N]] 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:
    (wkDiEdge: OuterNode[WkDiEdge[N]]).isEdge
    Definition Classes
    NodeParam
  5. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to OuterNode[WkDiEdge[N]] 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:
    (wkDiEdge: OuterNode[WkDiEdge[N]]).isIn
    Definition Classes
    InParam → Param
  6. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to OuterNode[WkDiEdge[N]] 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:
    (wkDiEdge: OuterNode[WkDiEdge[N]]).isNode
    Definition Classes
    NodeParam
  7. def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to OuterNode[WkDiEdge[N]] 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:
    (wkDiEdge: OuterNode[WkDiEdge[N]]).isOut
    Definition Classes
    InParam → Param
  8. def map[B](f: (N) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to MonadOps[N] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (wkDiEdge: MonadOps[N]).map(f)
    Definition Classes
    MonadOps
  9. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to OuterNode[WkDiEdge[N]] 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:
    (wkDiEdge: OuterNode[WkDiEdge[N]]).stringPrefix
    Definition Classes
    NodeParam
  10. def toString(): String
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to OuterNode[WkDiEdge[N]] 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:
    (wkDiEdge: OuterNode[WkDiEdge[N]]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  11. def withFilter(p: (N) ⇒ Boolean): Iterator[N]
    Implicit
    This member is added by an implicit conversion from WkDiEdge[N] to MonadOps[N] performed by method MonadOps in scala.collection.TraversableOnce.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (wkDiEdge: MonadOps[N]).withFilter(p)
    Definition Classes
    MonadOps

Inherited from DiEdgeLike[N]

Inherited from EqDi

Inherited from DiHyperEdgeLike[N]

Inherited from EqDiHyper

Inherited from WkUnDiEdge[N]

Inherited from WkEdge[N]

Inherited from Keyed

Inherited from WUnDiEdge[N]

Inherited from WEdge[N]

Inherited from UnDiEdge[N]

Inherited from EqUnDi

Inherited from HyperEdge[N]

Inherited from EqHyper

Inherited from OuterEdge[N, WkDiEdge]

Inherited from EdgeParam

Inherited from InParam[N, WkDiEdge]

Inherited from Param[N, WkDiEdge]

Inherited from EdgeCopy[WUnDiEdge]

Inherited from EdgeLike[N]

Inherited from Serializable

Inherited from Serializable

Inherited from Eq

Inherited from Iterable[N]

Inherited from IterableLike[N, Iterable[N]]

Inherited from Equals

Inherited from GenIterable[N]

Inherited from GenIterableLike[N, Iterable[N]]

Inherited from Traversable[N]

Inherited from GenTraversable[N]

Inherited from GenericTraversableTemplate[N, Iterable]

Inherited from TraversableLike[N, Iterable[N]]

Inherited from GenTraversableLike[N, Iterable[N]]

Inherited from Parallelizable[N, ParIterable[N]]

Inherited from TraversableOnce[N]

Inherited from GenTraversableOnce[N]

Inherited from FilterMonadic[N, Iterable[N]]

Inherited from HasNewBuilder[N, Iterable[N]]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion anyToNode from WkDiEdge[N] to OuterNode[WkDiEdge[N]]

Inherited by implicit conversion CollectionsHaveToParArray from WkDiEdge[N] to CollectionsHaveToParArray[WkDiEdge[N], T]

Inherited by implicit conversion MonadOps from WkDiEdge[N] to MonadOps[N]

Inherited by implicit conversion HyperEdgeAssoc from WkDiEdge[N] to HyperEdgeAssoc[N]

Inherited by implicit conversion EdgeAssoc from WkDiEdge[N] to EdgeAssoc[WkDiEdge[N]]

Inherited by implicit conversion any2stringadd from WkDiEdge[N] to any2stringadd[WkDiEdge[N]]

Inherited by implicit conversion StringFormat from WkDiEdge[N] to StringFormat[WkDiEdge[N]]

Inherited by implicit conversion Ensuring from WkDiEdge[N] to Ensuring[WkDiEdge[N]]

Inherited by implicit conversion ArrowAssoc from WkDiEdge[N] to ArrowAssoc[WkDiEdge[N]]

Inherited by implicit conversion alternateImplicit from WkDiEdge[N] to ForceImplicitAmbiguity

Ungrouped