Packages

t

scalax.collection.GraphEdge

DiHyperEdgeLike

trait DiHyperEdgeLike[+N] extends EdgeLike[N] with EqDiHyper

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DiHyperEdgeLike
  2. EqDiHyper
  3. EdgeLike
  4. Serializable
  5. Serializable
  6. Eq
  7. Iterable
  8. IterableLike
  9. Equals
  10. GenIterable
  11. GenIterableLike
  12. Traversable
  13. GenTraversable
  14. GenericTraversableTemplate
  15. TraversableLike
  16. GenTraversableLike
  17. Parallelizable
  18. TraversableOnce
  19. GenTraversableOnce
  20. FilterMonadic
  21. HasNewBuilder
  22. AnyRef
  23. Any
Implicitly
  1. by CollectionsHaveToParArray
  2. by MonadOps
  3. by any2stringadd
  4. by StringFormat
  5. by Ensuring
  6. by ArrowAssoc
  7. by alternateImplicit
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

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

Abstract Value Members

  1. abstract 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
    EdgeLike
  2. abstract 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
    EdgeLike
  3. abstract 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
    EdgeLike
  4. abstract def iterator: Iterator[N]

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

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

    Definition Classes
    EdgeLike → IterableLike → GenIterableLike
  5. abstract 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.

    Definition Classes
    EdgeLike

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 DiHyperEdgeLike[N] to any2stringadd[DiHyperEdgeLike[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): (DiHyperEdgeLike[N], B)
    Implicit
    This member is added by an implicit conversion from DiHyperEdgeLike[N] to ArrowAssoc[DiHyperEdgeLike[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
    EdgeLike
  21. def baseEquals(other: EdgeLike[_]): Boolean
    Attributes
    protected
    Definition Classes
    EqDiHyper → Eq
  22. def baseHashCode: Int
    Attributes
    protected
    Definition Classes
    EqDiHyper → 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 copyToArray[B >: N](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  31. def copyToArray[B >: N](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  32. def copyToArray[B >: N](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def copyToBuffer[B >: N](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  34. def count(p: (N) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  35. final def directed: Boolean

    true if this edge is directed.

    true if this edge is directed.

    Definition Classes
    DiHyperEdgeLike → EdgeLike
    Annotations
    @inline()
  36. def drop(n: Int): Iterable[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  37. def dropRight(n: Int): Iterable[N]
    Definition Classes
    IterableLike
  38. def dropWhile(p: (N) ⇒ Boolean): Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  39. def ensuring(cond: (DiHyperEdgeLike[N]) ⇒ Boolean, msg: ⇒ Any): DiHyperEdgeLike[N]
    Implicit
    This member is added by an implicit conversion from DiHyperEdgeLike[N] to Ensuring[DiHyperEdgeLike[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  40. def ensuring(cond: (DiHyperEdgeLike[N]) ⇒ Boolean): DiHyperEdgeLike[N]
    Implicit
    This member is added by an implicit conversion from DiHyperEdgeLike[N] to Ensuring[DiHyperEdgeLike[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  41. def ensuring(cond: Boolean, msg: ⇒ Any): DiHyperEdgeLike[N]
    Implicit
    This member is added by an implicit conversion from DiHyperEdgeLike[N] to Ensuring[DiHyperEdgeLike[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  42. def ensuring(cond: Boolean): DiHyperEdgeLike[N]
    Implicit
    This member is added by an implicit conversion from DiHyperEdgeLike[N] to Ensuring[DiHyperEdgeLike[N]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  43. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  44. def equals(other: EdgeLike[_]): Boolean

    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
  45. def equals(other: Any): Boolean
    Definition Classes
    EdgeLike → Equals → AnyRef → Any
  46. def exists(p: (N) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  47. def filter(p: (N) ⇒ Boolean): Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  48. def filterNot(p: (N) ⇒ Boolean): Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  49. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  50. def find(p: (N) ⇒ Boolean): Option[N]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  51. def flatMap[B, That](f: (N) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  52. def flatten[B](implicit asTraversable: (N) ⇒ GenTraversableOnce[B]): Iterable[B]
    Definition Classes
    GenericTraversableTemplate
  53. def fold[A1 >: N](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  54. def foldLeft[B](z: B)(op: (B, N) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  55. def foldRight[B](z: B)(op: (N, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  56. def forall(p: (N) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  57. def foreach[U](f: (N) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  58. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from DiHyperEdgeLike[N] to StringFormat[DiHyperEdgeLike[N]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  59. final def from: N

    Synonym for source.

    Synonym for source.

    Annotations
    @inline()
  60. def genericBuilder[B]: Builder[B, Iterable[B]]
    Definition Classes
    GenericTraversableTemplate
  61. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  62. def groupBy[K](f: (N) ⇒ K): Map[K, Iterable[N]]
    Definition Classes
    TraversableLike → GenTraversableLike
  63. def grouped(size: Int): Iterator[Iterable[N]]
    Definition Classes
    IterableLike
  64. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  65. 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
    DiHyperEdgeLike → EdgeLike
  66. 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
    DiHyperEdgeLike → EdgeLike
  67. 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
    DiHyperEdgeLike → EdgeLike
  68. 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
    DiHyperEdgeLike → EdgeLike
  69. def hashCode(): Int
    Definition Classes
    EdgeLike → AnyRef → Any
  70. def head: N
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  71. def headOption: Option[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  72. def init: Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  73. def inits: Iterator[Iterable[N]]
    Definition Classes
    TraversableLike
  74. final def isDirected: Boolean

    Same as directed.

    Same as directed.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  75. def isEmpty: Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  76. 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
    EdgeLike
  77. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  78. def isLabeled: Boolean

    true if this edge is labeled.

    true if this edge is labeled. See also label.

    Definition Classes
    EdgeLike
  79. 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
  80. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  81. final def isUndirected: Boolean

    Same as undirected.

    Same as undirected.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  82. 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
  83. def isValidCustomExceptionMessage: String
    Attributes
    protected
    Definition Classes
    EdgeLike
  84. 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.

  85. def last: N
    Definition Classes
    TraversableLike → GenTraversableLike
  86. def lastOption: Option[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  87. def map[B, That](f: (N) ⇒ B)(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  88. 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
    DiHyperEdgeLike → EdgeLike
  89. 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
    DiHyperEdgeLike → EdgeLike
  90. def max[B >: N](implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. def maxBy[B](f: (N) ⇒ B)(implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. def min[B >: N](implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  93. def minBy[B](f: (N) ⇒ B)(implicit cmp: Ordering[B]): N
    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  96. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  98. def newBuilder: Builder[N, Iterable[N]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  99. def nodeSeq: Seq[N]

    Sequence of the end points of this edge.

    Sequence of the end points of this edge.

    Definition Classes
    EdgeLike
  100. def nodesToString: String
    Attributes
    protected
    Definition Classes
    EdgeLike
  101. def nodesToStringSeparator: String
    Attributes
    protected
    Definition Classes
    DiHyperEdgeLike → EdgeLike
  102. def nodesToStringWithParenthesis: Boolean
    Attributes
    protected
    Definition Classes
    EdgeLike
  103. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  104. 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()
  105. final def nonLooping: Boolean

    Same as ! looping.

    Same as ! looping.

    Definition Classes
    EdgeLike
  106. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  107. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  108. def par: ParIterable[N]
    Definition Classes
    Parallelizable
  109. def parCombiner: Combiner[N, ParIterable[N]]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  110. def partition(p: (N) ⇒ Boolean): (Iterable[N], Iterable[N])
    Definition Classes
    TraversableLike → GenTraversableLike
  111. def product[B >: N](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  112. def reduce[A1 >: N](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  113. def reduceLeft[B >: N](op: (B, N) ⇒ B): B
    Definition Classes
    TraversableOnce
  114. def reduceLeftOption[B >: N](op: (B, N) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def reduceOption[A1 >: N](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def reduceRight[B >: N](op: (N, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  117. def reduceRightOption[B >: N](op: (N, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  118. def repr: Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  119. def reversed: List[N]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  120. def sameElements[B >: N](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  121. def scan[B >: N, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  122. def scanLeft[B, That](z: B)(op: (B, N) ⇒ B)(implicit bf: CanBuildFrom[Iterable[N], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  123. 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.

  124. def seq: Iterable[N]
    Definition Classes
    Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  125. def size: Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  126. def sizeHintIfCheap: Int
    Attributes
    protected[scala.collection]
    Definition Classes
    GenTraversableOnce
  127. def slice(from: Int, until: Int): Iterable[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  128. def sliding(size: Int, step: Int): Iterator[Iterable[N]]
    Definition Classes
    IterableLike
  129. def sliding(size: Int): Iterator[Iterable[N]]
    Definition Classes
    IterableLike
  130. final def source: N

    The single source node of this directed edge.

    The single source node of this directed edge.

    Annotations
    @inline()
  131. def sources: Traversable[N]

    All source ends of this edge.

    All source ends of this edge.

    Definition Classes
    EdgeLike
  132. def span(p: (N) ⇒ Boolean): (Iterable[N], Iterable[N])
    Definition Classes
    TraversableLike → GenTraversableLike
  133. def splitAt(n: Int): (Iterable[N], Iterable[N])
    Definition Classes
    TraversableLike → GenTraversableLike
  134. def stringPrefix: String
    Definition Classes
    EdgeLike → TraversableLike → GenTraversableLike
  135. def sum[B >: N](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  136. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  137. def tail: Iterable[N]
    Definition Classes
    TraversableLike → GenTraversableLike
  138. def tails: Iterator[Iterable[N]]
    Definition Classes
    TraversableLike
  139. def take(n: Int): Iterable[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  140. def takeRight(n: Int): Iterable[N]
    Definition Classes
    IterableLike
  141. def takeWhile(p: (N) ⇒ Boolean): Iterable[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  142. 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.

    Annotations
    @inline()
  143. def targets: Traversable[N]

    All target ends of this edge.

    All target ends of this edge.

    Definition Classes
    EdgeLike
  144. def thisCollection: Iterable[N]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  145. final def thisSimpleClassName: String
    Attributes
    protected
    Definition Classes
    EdgeLike
  146. def to: N

    Synonym for target.

  147. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, N, Col[N]]): Col[N]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  148. def toArray[B >: N](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  149. def toBuffer[B >: N]: Buffer[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  150. def toCollection(repr: Iterable[N]): Iterable[N]
    Attributes
    protected[this]
    Definition Classes
    IterableLike → TraversableLike
  151. def toIndexedSeq: IndexedSeq[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  152. def toIterable: Iterable[N]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  153. def toIterator: Iterator[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  154. def toList: List[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  155. def toMap[T, U](implicit ev: <:<[N, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  156. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from DiHyperEdgeLike[N] to CollectionsHaveToParArray[DiHyperEdgeLike[N], T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (DiHyperEdgeLike[N]) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  157. def toSeq: Seq[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  158. def toSet[B >: N]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  159. def toStream: Stream[N]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  160. def toString(): String
    Definition Classes
    EdgeLike → TraversableLike → AnyRef → Any
  161. def toStringWithParenthesis: Boolean
    Attributes
    protected
    Definition Classes
    EdgeLike
  162. def toTraversable: Traversable[N]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  163. def toVector: Vector[N]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  164. 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.

  165. final def undirected: Boolean

    true if this edge is undirected.

    true if this edge is undirected.

    Definition Classes
    EdgeLike
    Annotations
    @inline()
  166. def unzip[A1, A2](implicit asPair: (N) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
    Definition Classes
    GenericTraversableTemplate
  167. def unzip3[A1, A2, A3](implicit asTriple: (N) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
    Definition Classes
    GenericTraversableTemplate
  168. 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.

  169. def view(from: Int, until: Int): IterableView[N, Iterable[N]]
    Definition Classes
    IterableLike → TraversableLike
  170. def view: IterableView[N, Iterable[N]]
    Definition Classes
    IterableLike → TraversableLike
  171. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  172. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  173. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  174. 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.

    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
    EdgeLike
  175. def withFilter(p: (N) ⇒ Boolean): FilterMonadic[N, Iterable[N]]
    Definition Classes
    TraversableLike → FilterMonadic
  176. 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
    DiHyperEdgeLike → EdgeLike
  177. 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
    DiHyperEdgeLike → EdgeLike
  178. def zip[A1 >: N, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[N], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  179. 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
  180. def zipWithIndex[A1 >: N, That](implicit bf: CanBuildFrom[Iterable[N], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  181. def →[B](y: B): (DiHyperEdgeLike[N], B)
    Implicit
    This member is added by an implicit conversion from DiHyperEdgeLike[N] to ArrowAssoc[DiHyperEdgeLike[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 DiHyperEdgeLike[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:
    (diHyperEdgeLike: 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 DiHyperEdgeLike[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:
    (diHyperEdgeLike: MonadOps[N]).flatMap(f)
    Definition Classes
    MonadOps
  3. def map[B](f: (N) ⇒ B): TraversableOnce[B]
    Implicit
    This member is added by an implicit conversion from DiHyperEdgeLike[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:
    (diHyperEdgeLike: MonadOps[N]).map(f)
    Definition Classes
    MonadOps
  4. def withFilter(p: (N) ⇒ Boolean): Iterator[N]
    Implicit
    This member is added by an implicit conversion from DiHyperEdgeLike[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:
    (diHyperEdgeLike: MonadOps[N]).withFilter(p)
    Definition Classes
    MonadOps

Inherited from EqDiHyper

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 CollectionsHaveToParArray from DiHyperEdgeLike[N] to CollectionsHaveToParArray[DiHyperEdgeLike[N], T]

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

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

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

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

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

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

Ungrouped