Class/Object

scalax.collection.edge

WLUnDiEdge

Related Docs: object WLUnDiEdge | package edge

Permalink

abstract class WLUnDiEdge[+N] extends WUnDiEdge[N] with OuterEdge[N, WLUnDiEdge] with LEdge[N] with WLEdge[N]

weighted, labeled undirected edge.

Linear Supertypes
Known Subclasses
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. WLUnDiEdge
  2. WLEdge
  3. LEdge
  4. WUnDiEdge
  5. WEdge
  6. UnDiEdge
  7. EqUnDi
  8. HyperEdge
  9. EqHyper
  10. OuterEdge
  11. EdgeParam
  12. InParam
  13. Param
  14. EdgeCopy
  15. EdgeLike
  16. Serializable
  17. Serializable
  18. Eq
  19. Iterable
  20. IterableLike
  21. Equals
  22. GenIterable
  23. GenIterableLike
  24. Traversable
  25. GenTraversable
  26. GenericTraversableTemplate
  27. TraversableLike
  28. GenTraversableLike
  29. Parallelizable
  30. TraversableOnce
  31. GenTraversableOnce
  32. FilterMonadic
  33. HasNewBuilder
  34. AnyRef
  35. Any
Implicitly
  1. by anyToNode
  2. by CollectionsHaveToParArray
  3. by MonadOps
  4. by HyperEdgeAssoc
  5. by EdgeAssoc
  6. by graphParamsToPartition
  7. by any2stringadd
  8. by StringFormat
  9. by Ensuring
  10. by ArrowAssoc
  11. by alternateImplicit
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new WLUnDiEdge(nodes: Product, weight: Long)

    Permalink

Type Members

  1. class EdgeException extends Exception

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeLike
  2. abstract type L1

    Permalink
    Definition Classes
    LEdge
  3. type Self = Iterable[N]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  4. class WithFilter extends FilterMonadic[A, Repr]

    Permalink
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to any2stringadd[WLUnDiEdge[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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  5. def ++:[B >: N, That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That

    Permalink
    Definition Classes
    TraversableLike
  6. def ++:[B >: N, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That

    Permalink
    Definition Classes
    TraversableLike
  7. def ->[B](y: B): (WLUnDiEdge[N], B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to ArrowAssoc[WLUnDiEdge[N]] performed by method ArrowAssoc in scala.Predef. This conversion will take place only if N is a subclass of Param[Nothing, Nothing] (N <: Param[Nothing, Nothing]).
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  8. def /:[B](z: B)(op: (B, N) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  9. def :\[B](z: B)(op: (N, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  10. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  11. final def _1: N

    Permalink

    The first node.

    The first node. Same as _n(0).

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

    Permalink

    The second node.

    The second node. Same as _n(1).

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

    Permalink

    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

    Permalink
    Definition Classes
    TraversableOnce
  15. def addString(b: StringBuilder, sep: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  16. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  17. def aggregate[B](z: ⇒ B)(seqop: (B, N) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  18. final def arity: Int

    Permalink

    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

    Permalink
    Definition Classes
    Any
  20. def attributesToString: String

    Permalink
    Attributes
    protected
    Definition Classes
    WLEdgeLEdgeWEdge
  21. def baseEquals(other: EdgeLike[_]): Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    EqUnDiEq
  22. def baseHashCode: Int

    Permalink
    Attributes
    protected
    Definition Classes
    EqUnDiEq
  23. def brackets: Brackets

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeLike
  24. def canEqual(that: Any): Boolean

    Permalink
    Definition Classes
    EdgeLike → IterableLike → Equals
  25. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  26. def collect[B, That](pf: PartialFunction[N, B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  27. def collectFirst[B](pf: PartialFunction[N, B]): Option[B]

    Permalink
    Definition Classes
    TraversableOnce
  28. def companion: GenericCompanion[Iterable]

    Permalink
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  29. final def contains[M >: N](node: M): Boolean

    Permalink

    Same as isAt.

    Same as isAt.

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

    Permalink

    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
    WUnDiEdgeUnDiEdgeHyperEdgeEdgeCopy
  31. def copyToArray[B >: N](xs: Array[B], start: Int, len: Int): Unit

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  32. def copyToArray[B >: N](xs: Array[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def copyToArray[B >: N](xs: Array[B], start: Int): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  34. def copyToBuffer[B >: N](dest: Buffer[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce
  35. def count(p: (N) ⇒ Boolean): Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  36. def directed: Boolean

    Permalink

    true if this edge is directed.

    true if this edge is directed.

    Definition Classes
    EdgeLike
  37. def drop(n: Int): Iterable[N]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  38. def dropRight(n: Int): Iterable[N]

    Permalink
    Definition Classes
    IterableLike
  39. def dropWhile(p: (N) ⇒ Boolean): Iterable[N]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  40. val e: EdgeLikeIn[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to HyperEdgeAssoc[N] performed by method HyperEdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    HyperEdgeAssoc
  41. def edge: WLUnDiEdge[N]

    Permalink
    Definition Classes
    OuterEdge
  42. def edgeParams: Traversable[EdgeParam]

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef. This conversion will take place only if N is a subclass of Param[N, E] (N <: Param[N, E]).
    Definition Classes
    Partitions
  43. val elems: Traversable[Param[N, E]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef. This conversion will take place only if N is a subclass of Param[N, E] (N <: Param[N, E]).
    Definition Classes
    Partitions
  44. def ensuring(cond: (WLUnDiEdge[N]) ⇒ Boolean, msg: ⇒ Any): WLUnDiEdge[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to Ensuring[WLUnDiEdge[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  45. def ensuring(cond: (WLUnDiEdge[N]) ⇒ Boolean): WLUnDiEdge[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to Ensuring[WLUnDiEdge[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  46. def ensuring(cond: Boolean, msg: ⇒ Any): WLUnDiEdge[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to Ensuring[WLUnDiEdge[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  47. def ensuring(cond: Boolean): WLUnDiEdge[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to Ensuring[WLUnDiEdge[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  48. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  49. def equals(other: EdgeLike[_]): Boolean

    Permalink

    Preconditions: this.directed == that.directed && this.isInstanceOf[Keyed] == that.isInstanceOf[Keyed]

    Preconditions: this.directed == that.directed && this.isInstanceOf[Keyed] == that.isInstanceOf[Keyed]

    Attributes
    protected
    Definition Classes
    EdgeLike
  50. def equals(other: Any): Boolean

    Permalink
    Definition Classes
    EdgeLike → Equals → AnyRef → Any
  51. def exists(p: (N) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  52. def filter(p: (N) ⇒ Boolean): Iterable[N]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  53. def filterNot(p: (N) ⇒ Boolean): Iterable[N]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  54. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  55. def find(p: (N) ⇒ Boolean): Option[N]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  56. def flatMap[B, That](f: (N) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  57. def flatten[B](implicit asTraversable: (N) ⇒ GenTraversableOnce[B]): Iterable[B]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  58. def fold[A1 >: N](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  59. def foldLeft[B](z: B)(op: (B, N) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  60. def foldRight[B](z: B)(op: (N, B) ⇒ B): B

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  61. def forall(p: (N) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  62. def foreach[U](f: (N) ⇒ U): Unit

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  63. def formatted(fmtstr: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to StringFormat[WLUnDiEdge[N]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  64. def genericBuilder[B]: Builder[B, Iterable[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  65. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  66. def groupBy[K](f: (N) ⇒ K): Map[K, Iterable[N]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  67. def grouped(size: Int): Iterator[Iterable[N]]

    Permalink
    Definition Classes
    IterableLike
  68. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  69. def hasSource(pred: (N) ⇒ Boolean): Boolean

    Permalink

    true if any source end of this edge fulfills pred.

    true if any source end of this edge fulfills pred.

    Definition Classes
    HyperEdgeEdgeLike
  70. def hasSource[M >: N](node: M): Boolean

    Permalink

    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
    HyperEdgeEdgeLike
  71. def hasTarget(pred: (N) ⇒ Boolean): Boolean

    Permalink

    true if any target end of this edge fulfills pred.

    true if any target end of this edge fulfills pred.

    Definition Classes
    HyperEdgeEdgeLike
  72. def hasTarget[M >: N](node: M): Boolean

    Permalink

    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
    HyperEdgeEdgeLike
  73. def hashCode(): Int

    Permalink
    Definition Classes
    EdgeLike → AnyRef → Any
  74. def head: N

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  75. def headOption: Option[N]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  76. def init: Iterable[N]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  77. def inits: Iterator[Iterable[N]]

    Permalink
    Definition Classes
    TraversableLike
  78. def isAt(pred: (N) ⇒ Boolean): Boolean

    Permalink

    true if any end of this edge fulfills pred.

    true if any end of this edge fulfills pred.

    Definition Classes
    UnDiEdgeHyperEdgeEdgeLike
  79. def isAt[M >: N](node: M): Boolean

    Permalink

    true if node is incident with this edge.

    true if node is incident with this edge.

    Definition Classes
    UnDiEdgeHyperEdgeEdgeLike
  80. def isDefined: Boolean

    Permalink
    Definition Classes
    Param
  81. final def isDirected: Boolean

    Permalink

    Same as directed.

    Same as directed.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  82. def isEdge: Boolean

    Permalink
    Definition Classes
    EdgeParam
  83. def isEmpty: Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  84. final def isHyperEdge: Boolean

    Permalink

    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
    UnDiEdgeEdgeLike
    Annotations
    @inline()
  85. def isIn: Boolean

    Permalink
    Definition Classes
    InParamParam
  86. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  87. def isLabeled: Boolean

    Permalink

    true if this edge is labeled.

    true if this edge is labeled. See also label.

    Definition Classes
    EdgeLike
  88. def isLooping: Boolean

    Permalink

    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

    Permalink
    Definition Classes
    EdgeParam
  90. def isOut: Boolean

    Permalink
    Definition Classes
    InParamParam
  91. final def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  92. final def isUndirected: Boolean

    Permalink

    Same as undirected.

    Same as undirected.

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

    Permalink

    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
    UnDiEdgeHyperEdgeEdgeLike
    Annotations
    @inline()
  94. def isValidCustom: Boolean

    Permalink

    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

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeLike
  96. def iterator: Iterator[N]

    Permalink

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

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

    Definition Classes
    UnDiEdgeHyperEdgeEdgeLike → IterableLike → GenIterableLike
  97. def label: L1

    Permalink
    Definition Classes
    LEdge
  98. def last: N

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  99. def lastOption: Option[N]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  100. def map[B, That](f: (N) ⇒ B)(implicit bf: CanBuildFrom[Iterable[N], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  101. def matches(p1: (N) ⇒ Boolean, p2: (N) ⇒ Boolean): Boolean

    Permalink

    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
    UnDiEdgeHyperEdgeEdgeLike
  102. def matches[M >: N](n1: M, n2: M): Boolean

    Permalink

    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
    UnDiEdgeHyperEdgeEdgeLike
  103. final def matches(fList: List[(N) ⇒ Boolean]): Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    HyperEdge
  104. def max[B >: N](implicit cmp: Ordering[B]): N

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  105. def maxBy[B](f: (N) ⇒ B)(implicit cmp: Ordering[B]): N

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. def min[B >: N](implicit cmp: Ordering[B]): N

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  107. def minBy[B](f: (N) ⇒ B)(implicit cmp: Ordering[B]): N

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  108. def mkString: String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  109. def mkString(sep: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  110. def mkString(start: String, sep: String, end: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  111. val n1: WLUnDiEdge[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to EdgeAssoc[WLUnDiEdge[N]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  112. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  113. def newBuilder: Builder[N, Iterable[N]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  114. def nodeParams: Traversable[NodeParam[N]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef. This conversion will take place only if N is a subclass of Param[N, E] (N <: Param[N, E]).
    Definition Classes
    Partitions
  115. def nodeSeq: Seq[N]

    Permalink

    Sequence of the end points of this edge.

    Sequence of the end points of this edge.

    Definition Classes
    EdgeLike
  116. val nodes: Product

    Permalink

    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
    HyperEdgeEdgeLike
  117. def nodesToString: String

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeLike
  118. def nodesToStringSeparator: String

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeLike
  119. def nodesToStringWithParenthesis: Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeLike
  120. def nonEmpty: Boolean

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  121. final def nonHyperEdge: Boolean

    Permalink

    true if this edge has exactly two ends.

    true if this edge has exactly two ends.

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

    Permalink

    Same as ! looping.

    Same as ! looping.

    Definition Classes
    EdgeLike
  123. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  124. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  125. def par: ParIterable[N]

    Permalink
    Definition Classes
    Parallelizable
  126. def parCombiner: Combiner[N, ParIterable[N]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  127. def partition(p: (N) ⇒ Boolean): (Iterable[N], Iterable[N])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  128. lazy val partitioned: (Traversable[Param[N, E]], Traversable[Param[N, E]])

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef. This conversion will take place only if N is a subclass of Param[N, E] (N <: Param[N, E]).
    Definition Classes
    Partitions
  129. def product[B >: N](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  130. def reduce[A1 >: N](op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  131. def reduceLeft[B >: N](op: (B, N) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce
  132. def reduceLeftOption[B >: N](op: (B, N) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  133. def reduceOption[A1 >: N](op: (A1, A1) ⇒ A1): Option[A1]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  134. def reduceRight[B >: N](op: (N, B) ⇒ B): B

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  135. def reduceRightOption[B >: N](op: (N, B) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  136. def repr: Iterable[N]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  137. def reversed: List[N]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  138. def sameElements[B >: N](that: GenIterable[B]): Boolean

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  139. def scan[B >: N, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[N], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  140. def scanLeft[B, That](z: B)(op: (B, N) ⇒ B)(implicit bf: CanBuildFrom[Iterable[N], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  141. def scanRight[B, That](z: B)(op: (N, B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[N], B, That]): That

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

  142. def seq: Iterable[N]

    Permalink
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  143. final def size: Int

    Permalink
    Definition Classes
    UnDiEdge → GenTraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @inline()
  144. def slice(from: Int, until: Int): Iterable[N]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  145. def sliding(size: Int, step: Int): Iterator[Iterable[N]]

    Permalink
    Definition Classes
    IterableLike
  146. def sliding(size: Int): Iterator[Iterable[N]]

    Permalink
    Definition Classes
    IterableLike
  147. def sources: Traversable[N]

    Permalink

    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])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  149. def splitAt(n: Int): (Iterable[N], Iterable[N])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  150. def stringPrefix: String

    Permalink
    Definition Classes
    EdgeLike → TraversableLike → GenTraversableLike
  151. def sum[B >: N](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  152. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  153. def tail: Iterable[N]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  154. def tails: Iterator[Iterable[N]]

    Permalink
    Definition Classes
    TraversableLike
  155. def take(n: Int): Iterable[N]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  156. def takeRight(n: Int): Iterable[N]

    Permalink
    Definition Classes
    IterableLike
  157. def takeWhile(p: (N) ⇒ Boolean): Iterable[N]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  158. def targets: Traversable[N]

    Permalink

    All target ends of this edge.

    All target ends of this edge.

    Definition Classes
    EdgeLike
  159. def thisCollection: Iterable[N]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  160. final def thisSimpleClassName: String

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeLike
  161. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, N, Col[N]]): Col[N]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  162. def toArray[B >: N](implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  163. def toBuffer[B >: N]: Buffer[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  164. def toCollection(repr: Iterable[N]): Iterable[N]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  165. def toInParams: Traversable[InParam[N, E]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef. This conversion will take place only if N is a subclass of Param[N, E] (N <: Param[N, E]).
    Definition Classes
    Partitions
  166. def toIndexedSeq: IndexedSeq[N]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  167. def toIterable: Iterable[N]

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  168. def toIterator: Iterator[N]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  169. def toList: List[N]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  170. def toMap[T, U](implicit ev: <:<[N, (T, U)]): Map[T, U]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  171. def toOuterEdges: Traversable[E[N]]

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef. This conversion will take place only if N is a subclass of Param[N, E] (N <: Param[N, E]).
    Definition Classes
    Partitions
  172. def toOuterNodes: Traversable[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to Partitions[N, E] performed by method graphParamsToPartition in scalax.collection.GraphPredef. This conversion will take place only if N is a subclass of Param[N, E] (N <: Param[N, E]).
    Definition Classes
    Partitions
  173. def toParArray: ParArray[T]

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to CollectionsHaveToParArray[WLUnDiEdge[N], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (WLUnDiEdge[N]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  174. def toSeq: Seq[N]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  175. def toSet[B >: N]: Set[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  176. def toStream: Stream[N]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  177. def toString(): String

    Permalink
    Definition Classes
    EdgeLike → TraversableLike → AnyRef → Any
  178. def toStringWithParenthesis: Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    EdgeLike
  179. def toTraversable: Traversable[N]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  180. def toVector: Vector[N]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  181. def transpose[B](implicit asTraversable: (N) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

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

  182. final def unDiBaseEquals(n1: Any, n2: Any): Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    EqUnDi
    Annotations
    @inline()
  183. final def undirected: Boolean

    Permalink

    true if this edge is undirected.

    true if this edge is undirected.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  184. def unzip[A1, A2](implicit asPair: (N) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  185. def unzip3[A1, A2, A3](implicit asTriple: (N) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  186. final def validate: Unit

    Permalink

    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.

  187. val value: WLUnDiEdge[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to OuterNode[WLUnDiEdge[N]] performed by method anyToNode in scalax.collection.GraphPredef.
    Definition Classes
    OuterNodeNodeParam
  188. def view(from: Int, until: Int): IterableView[N, Iterable[N]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike
  189. def view: IterableView[N, Iterable[N]]

    Permalink
    Definition Classes
    IterableLike → TraversableLike
  190. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  191. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  192. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  193. val weight: Long

    Permalink

    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
    WUnDiEdgeEdgeLike
  194. def withFilter(p: (N) ⇒ Boolean): FilterMonadic[N, Iterable[N]]

    Permalink
    Definition Classes
    TraversableLike → FilterMonadic
  195. def withSources[U](f: (N) ⇒ U): Unit

    Permalink

    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
    UnDiEdgeHyperEdgeEdgeLike
  196. def withTargets[U](f: (N) ⇒ U): Unit

    Permalink

    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
    UnDiEdgeHyperEdgeEdgeLike
  197. def zip[A1 >: N, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[N], (A1, B), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  198. def zipAll[B, A1 >: N, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[N], (A1, B), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  199. def zipWithIndex[A1 >: N, That](implicit bf: CanBuildFrom[Iterable[N], (A1, Int), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  200. def ~[N >: NOld](n: N)(implicit endpointsKind: CollectionKind = Bag): HyperEdge[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to HyperEdgeAssoc[N] performed by method HyperEdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    HyperEdgeAssoc
  201. def ~[N >: N1](n2: N): UnDiEdge[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to EdgeAssoc[WLUnDiEdge[N]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  202. def ~>[N >: NOld](n: N)(implicit targetsKind: CollectionKind = Bag): DiHyperEdge[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to HyperEdgeAssoc[N] performed by method HyperEdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    HyperEdgeAssoc
  203. def ~>[N >: N1](n2: N): DiEdge[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to EdgeAssoc[WLUnDiEdge[N]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  204. def [B](y: B): (WLUnDiEdge[N], B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to ArrowAssoc[WLUnDiEdge[N]] performed by method ArrowAssoc in scala.Predef. This conversion will take place only if N is a subclass of Param[Nothing, Nothing] (N <: Param[Nothing, Nothing]).
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def filter(p: (N) ⇒ Boolean): TraversableOnce[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[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:
    (wLUnDiEdge: MonadOps[N]).filter(p)
    Definition Classes
    MonadOps
  2. def flatMap[B](f: (N) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[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:
    (wLUnDiEdge: MonadOps[N]).flatMap(f)
    Definition Classes
    MonadOps
  3. def isDefined: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to OuterNode[WLUnDiEdge[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:
    (wLUnDiEdge: OuterNode[WLUnDiEdge[N]]).isDefined
    Definition Classes
    Param
  4. def isEdge: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to OuterNode[WLUnDiEdge[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:
    (wLUnDiEdge: OuterNode[WLUnDiEdge[N]]).isEdge
    Definition Classes
    NodeParam
  5. def isIn: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to OuterNode[WLUnDiEdge[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:
    (wLUnDiEdge: OuterNode[WLUnDiEdge[N]]).isIn
    Definition Classes
    InParamParam
  6. def isNode: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to OuterNode[WLUnDiEdge[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:
    (wLUnDiEdge: OuterNode[WLUnDiEdge[N]]).isNode
    Definition Classes
    NodeParam
  7. def isOut: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to OuterNode[WLUnDiEdge[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:
    (wLUnDiEdge: OuterNode[WLUnDiEdge[N]]).isOut
    Definition Classes
    InParamParam
  8. def map[B](f: (N) ⇒ B): TraversableOnce[B]

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[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:
    (wLUnDiEdge: MonadOps[N]).map(f)
    Definition Classes
    MonadOps
  9. def stringPrefix: String

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to OuterNode[WLUnDiEdge[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:
    (wLUnDiEdge: OuterNode[WLUnDiEdge[N]]).stringPrefix
    Definition Classes
    NodeParam
  10. def toString(): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[N] to OuterNode[WLUnDiEdge[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:
    (wLUnDiEdge: OuterNode[WLUnDiEdge[N]]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  11. def withFilter(p: (N) ⇒ Boolean): Iterator[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from WLUnDiEdge[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:
    (wLUnDiEdge: MonadOps[N]).withFilter(p)
    Definition Classes
    MonadOps

Inherited from WLEdge[N]

Inherited from LEdge[N]

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, WLUnDiEdge]

Inherited from EdgeParam

Inherited from InParam[N, WLUnDiEdge]

Inherited from Param[N, WLUnDiEdge]

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 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 WLUnDiEdge[N] to OuterNode[WLUnDiEdge[N]]

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

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

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

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

Inherited by implicit conversion graphParamsToPartition from WLUnDiEdge[N] to Partitions[N, E]

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

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

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

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

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

Ungrouped