WkLDiEdge

Companion object WkLDiEdge

abstract class WkLDiEdge[+N] extends WkLUnDiEdge[N] with DiEdgeLike[N] with OuterEdge[N, WkLDiEdge] with EqDi

key-weighted, labeled directed edge.

Linear Supertypes

DiEdgeLike[N], EqDi, DiHyperEdgeLike[N], EqDiHyper, WkLUnDiEdge[N], WkEdge[N], Keyed, WLUnDiEdge[N], WLEdge[N], LEdge[N], WUnDiEdge[N], WEdge[N], UnDiEdge[N], EqUnDi, HyperEdge[N], EqHyper, OuterEdge[N, WkLDiEdge], EdgeParam, InParam[N, WkLDiEdge], Param[N, WkLDiEdge], EdgeCopy[WUnDiEdge], EdgeLike[N], Serializable, Serializable, Eq, Iterable[N], IterableLike[N, Iterable[N]], Equals, GenIterable[N], GenIterableLike[N, Iterable[N]], Traversable[N], GenTraversable[N], GenericTraversableTemplate[N, Iterable], TraversableLike[N, Iterable[N]], GenTraversableLike[N, Iterable[N]], Parallelizable[N, ParIterable[N]], TraversableOnce[N], GenTraversableOnce[N], FilterMonadic[N, Iterable[N]], HasNewBuilder[N, Iterable[N]], AnyRef, Any

Ordering

Alphabetic
By Inheritance

Inherited

WkLDiEdge
DiEdgeLike
EqDi
DiHyperEdgeLike
EqDiHyper
WkLUnDiEdge
WkEdge
Keyed
WLUnDiEdge
WLEdge
LEdge
WUnDiEdge
WEdge
UnDiEdge
EqUnDi
HyperEdge
EqHyper
OuterEdge
EdgeParam
InParam
Param
EdgeCopy
EdgeLike
Serializable
Serializable
Eq
Iterable
IterableLike
Equals
GenIterable
GenIterableLike
Traversable
GenTraversable
GenericTraversableTemplate
TraversableLike
GenTraversableLike
Parallelizable
TraversableOnce
GenTraversableOnce
FilterMonadic
HasNewBuilder
AnyRef
Any

Implicitly

by anyToNode
by CollectionsHaveToParArray
by MonadOps
by HyperEdgeAssoc
by EdgeAssoc
by any2stringadd
by StringFormat
by Ensuring
by ArrowAssoc
by alternateImplicit

Hide All
Show All

Visibility

Public
All

Instance Constructors

new WkLDiEdge(nodes: Product, weight: Double)

Type Members

class EdgeException extends Exception

Attributes
protected
Definition Classes
EdgeLike
abstract type L1

Definition Classes
LEdge
type Self = Iterable[N]

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

Definition Classes
TraversableLike

Value Members

final def !=(arg0: Any): Boolean

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

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

Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to any2stringadd[WkLDiEdge[N]] performed by method any2stringadd in scala.Predef.
Definition Classes
any2stringadd
def ++[B >: N, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That

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

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

Definition Classes
TraversableLike
def ->[B](y: B): (WkLDiEdge[N], B)

Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to ArrowAssoc[WkLDiEdge[N]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@inline()
def /:[B](z: B)(op: (B, N) ⇒ B): B

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

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

Definition Classes
AnyRef → Any
final def _1: N
The first node.
The first node. Same as _n(0).

Definition Classes
EdgeLike
Annotations
@inline()
def _2: N
The second node.
The second node. Same as _n(1).

Definition Classes
EdgeLike
def _n(n: Int): N
The n'th node with 0 <= n < arity.
The n'th node with 0 <= n < arity.

Definition Classes
EdgeLike
def addString(b: StringBuilder): StringBuilder

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

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

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

Definition Classes
TraversableOnce → GenTraversableOnce
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
final def asInstanceOf[T0]: T0

Definition Classes
Any
def attributesToString: String

Attributes
protected
Definition Classes
WLEdge → LEdge → WEdge
final def baseEquals(other: EdgeLike[_]): Boolean

Attributes
protected
Definition Classes
EqDi → Eq
def baseHashCode: Int

Attributes
protected
Definition Classes
EqDi → Eq
def brackets: Brackets

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

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

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

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

Definition Classes
TraversableOnce
def companion: GenericCompanion[Iterable]

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

Definition Classes
EdgeLike
Annotations
@inline()
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
def copyToArray[B >: N](xs: Array[B], start: Int, len: Int): Unit

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

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

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

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

Definition Classes
TraversableOnce → GenTraversableOnce
final def diBaseEquals(n1: Any, n2: Any): Boolean

Attributes
protected
Definition Classes
EqDi
Annotations
@inline()
final def directed: Boolean
true if this edge is directed.
true if this edge is directed.

Definition Classes
DiHyperEdgeLike → EdgeLike
Annotations
@inline()
def drop(n: Int): Iterable[N]

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

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

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

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

Definition Classes
OuterEdge
def ensuring(cond: (WkLDiEdge[N]) ⇒ Boolean, msg: ⇒ Any): WkLDiEdge[N]

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

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

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

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

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

Attributes
protected
Definition Classes
WkEdge
def equals(other: Any): Boolean

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

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

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

Definition Classes
TraversableLike → GenTraversableLike
def finalize(): Unit

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

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

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

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

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

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

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

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

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

Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to StringFormat[WkLDiEdge[N]] performed by method StringFormat in scala.Predef.
Definition Classes
StringFormat
Annotations
@inline()
final def from: N
Synonym for source.
Synonym for source.

Definition Classes
DiHyperEdgeLike
Annotations
@inline()
def genericBuilder[B]: Builder[B, Iterable[B]]

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

Definition Classes
AnyRef → Any
Annotations
@native()
def groupBy[K](f: (N) ⇒ K): Map[K, Iterable[N]]

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

Definition Classes
IterableLike
def hasDefiniteSize: Boolean

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
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
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
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
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
def hashCode(): Int

Definition Classes
WkEdge → AnyRef → Any
def head: N

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

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

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

Definition Classes
TraversableLike
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
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
def isDefined: Boolean

Definition Classes
Param
final def isDirected: Boolean
Same as directed.
Same as directed.

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

Definition Classes
EdgeParam
def isEmpty: Boolean

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
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()
def isIn: Boolean

Definition Classes
InParam → Param
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isLabeled: Boolean
true if this edge is labeled.
true if this edge is labeled. See also label.

Definition Classes
EdgeLike
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
def isNode: Boolean

Definition Classes
EdgeParam
def isOut: Boolean

Definition Classes
InParam → Param
final def isTraversableAgain: Boolean

Definition Classes
TraversableLike → GenTraversableLike → GenTraversableOnce
final def isUndirected: Boolean
Same as undirected.
Same as undirected.

Definition Classes
EdgeLike
Annotations
@inline()
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()
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
def isValidCustomExceptionMessage: String

Attributes
protected
Definition Classes
EdgeLike
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
def label: L1

Definition Classes
LEdge
def last: N

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

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

Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
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
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
final def matches(fList: List[(N) ⇒ Boolean]): Boolean

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

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

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

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

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString: String

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

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

Definition Classes
TraversableOnce → GenTraversableOnce
val n1: WkLDiEdge[N]

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

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

Attributes
protected[this]
Definition Classes
GenericTraversableTemplate → HasNewBuilder
def nodeSeq: Seq[N]
Sequence of the end points of this edge.
Sequence of the end points of this edge.

Definition Classes
EdgeLike
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
def nodesToString: String

Attributes
protected
Definition Classes
EdgeLike
def nodesToStringSeparator: String

Attributes
protected
Definition Classes
DiHyperEdgeLike → EdgeLike
def nodesToStringWithParenthesis: Boolean

Attributes
protected
Definition Classes
EdgeLike
def nonEmpty: Boolean

Definition Classes
TraversableOnce → GenTraversableOnce
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()
final def nonLooping: Boolean
Same as ! looping.
Same as ! looping.

Definition Classes
EdgeLike
final def notify(): Unit

Definition Classes
AnyRef
Annotations
@native()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@native()
def par: ParIterable[N]

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

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

Definition Classes
TraversableLike → GenTraversableLike
def product[B >: N](implicit num: Numeric[B]): B

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

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

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

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

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

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

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

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

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

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

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

Definition Classes
TraversableLike → GenTraversableLike
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.
def seq: Iterable[N]

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

Definition Classes
UnDiEdge → GenTraversableLike → TraversableOnce → GenTraversableOnce
Annotations
@inline()
def sizeHintIfCheap: Int

Attributes
protected[scala.collection]
Definition Classes
GenTraversableOnce
def slice(from: Int, until: Int): Iterable[N]

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

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

Definition Classes
IterableLike
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()
def sources: Traversable[N]
All source ends of this edge.
All source ends of this edge.

Definition Classes
EdgeLike
def span(p: (N) ⇒ Boolean): (Iterable[N], Iterable[N])

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

Definition Classes
TraversableLike → GenTraversableLike
def stringPrefix: String

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

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

Definition Classes
AnyRef
def tail: Iterable[N]

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

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

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

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

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
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()
def targets: Traversable[N]
All target ends of this edge.
All target ends of this edge.

Definition Classes
EdgeLike
def thisCollection: Iterable[N]

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

Attributes
protected
Definition Classes
EdgeLike
final def to: N
Synonym for target.
Synonym for target.

Definition Classes
DiEdgeLike → DiHyperEdgeLike
Annotations
@inline()
def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, N, Col[N]]): Col[N]

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

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

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

Attributes
protected[this]
Definition Classes
IterableLike → TraversableLike
def toIndexedSeq: IndexedSeq[N]

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

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

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

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

Definition Classes
TraversableOnce → GenTraversableOnce
def toParArray: ParArray[T]

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

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

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

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

Definition Classes
EdgeLike → TraversableLike → AnyRef → Any
def toStringWithParenthesis: Boolean

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

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

Definition Classes
TraversableOnce → GenTraversableOnce
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.
final def unDiBaseEquals(n1: Any, n2: Any): Boolean

Attributes
protected
Definition Classes
EqUnDi
Annotations
@inline()
final def undirected: Boolean
true if this edge is undirected.
true if this edge is undirected.

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

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

Definition Classes
GenericTraversableTemplate
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.
val value: WkLDiEdge[N]

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

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

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

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

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

Definition Classes
AnyRef
Annotations
@native() @throws( ... )
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
def withFilter(p: (N) ⇒ Boolean): FilterMonadic[N, Iterable[N]]

Definition Classes
TraversableLike → FilterMonadic
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
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
def zip[A1 >: N, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[N], (A1, B), That]): That

Definition Classes
IterableLike → GenIterableLike
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
def zipWithIndex[A1 >: N, That](implicit bf: CanBuildFrom[Iterable[N], (A1, Int), That]): That

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

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

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

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

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

Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to ArrowAssoc[WkLDiEdge[N]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc

Shadowed Implicit Value Members

def filter(p: (N) ⇒ Boolean): TraversableOnce[N]
Implicit
This member is added by an implicit conversion from WkLDiEdge[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:
(wkLDiEdge: MonadOps[N]).filter(p)
Definition Classes
MonadOps
def flatMap[B](f: (N) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
Implicit
This member is added by an implicit conversion from WkLDiEdge[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:
(wkLDiEdge: MonadOps[N]).flatMap(f)
Definition Classes
MonadOps
def isDefined: Boolean
Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[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:
(wkLDiEdge: OuterNode[WkLDiEdge[N]]).isDefined
Definition Classes
Param
def isEdge: Boolean
Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[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:
(wkLDiEdge: OuterNode[WkLDiEdge[N]]).isEdge
Definition Classes
NodeParam
def isIn: Boolean
Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[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:
(wkLDiEdge: OuterNode[WkLDiEdge[N]]).isIn
Definition Classes
InParam → Param
def isNode: Boolean
Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[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:
(wkLDiEdge: OuterNode[WkLDiEdge[N]]).isNode
Definition Classes
NodeParam
def isOut: Boolean
Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[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:
(wkLDiEdge: OuterNode[WkLDiEdge[N]]).isOut
Definition Classes
InParam → Param
def map[B](f: (N) ⇒ B): TraversableOnce[B]
Implicit
This member is added by an implicit conversion from WkLDiEdge[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:
(wkLDiEdge: MonadOps[N]).map(f)
Definition Classes
MonadOps
def stringPrefix: String
Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[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:
(wkLDiEdge: OuterNode[WkLDiEdge[N]]).stringPrefix
Definition Classes
NodeParam
def toString(): String
Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[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:
(wkLDiEdge: OuterNode[WkLDiEdge[N]]).toString()
Definition Classes
NodeParam → AnyRef → Any
def withFilter(p: (N) ⇒ Boolean): Iterator[N]
Implicit
This member is added by an implicit conversion from WkLDiEdge[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:
(wkLDiEdge: MonadOps[N]).withFilter(p)
Definition Classes
MonadOps

Inherited from DiEdgeLike[N]

Value Members

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
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
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
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
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
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
final def to: N
Synonym for target.
Synonym for target.

Definition Classes
DiEdgeLike → DiHyperEdgeLike
Annotations
@inline()
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
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

Inherited from EqDi

Value Members

final def baseEquals(other: EdgeLike[_]): Boolean

Attributes
protected
Definition Classes
EqDi → Eq
def baseHashCode: Int

Attributes
protected
Definition Classes
EqDi → Eq
final def diBaseEquals(n1: Any, n2: Any): Boolean

Attributes
protected
Definition Classes
EqDi
Annotations
@inline()

Inherited from DiHyperEdgeLike[N]

Value Members

final def directed: Boolean
true if this edge is directed.
true if this edge is directed.

Definition Classes
DiHyperEdgeLike → EdgeLike
Annotations
@inline()
final def from: N
Synonym for source.
Synonym for source.

Definition Classes
DiHyperEdgeLike
Annotations
@inline()
def nodesToStringSeparator: String

Attributes
protected
Definition Classes
DiHyperEdgeLike → EdgeLike
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()
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()

Inherited from WkEdge[N]

Value Members

def equals(other: EdgeLike[_]): Boolean

Attributes
protected
Definition Classes
WkEdge
def hashCode(): Int

Definition Classes
WkEdge → AnyRef → Any

Inherited from WLEdge[N]

Value Members

def attributesToString: String

Attributes
protected
Definition Classes
WLEdge → LEdge → WEdge

Inherited from LEdge[N]

Value Members

def label: L1

Definition Classes
LEdge

Inherited from WUnDiEdge[N]

Value Members

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

Inherited from UnDiEdge[N]

Value Members

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
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
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()
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()
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
final def size: Int

Definition Classes
UnDiEdge → GenTraversableLike → TraversableOnce → GenTraversableOnce
Annotations
@inline()

Inherited from EqUnDi

Value Members

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

Attributes
protected
Definition Classes
EqUnDi
Annotations
@inline()

Inherited from HyperEdge[N]

Value Members

final def matches(fList: List[(N) ⇒ Boolean]): Boolean

Attributes
protected
Definition Classes
HyperEdge
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

Inherited from OuterEdge[N, WkLDiEdge]

Value Members

def edge: WkLDiEdge[N]

Definition Classes
OuterEdge

Inherited from EdgeParam

Value Members

def isEdge: Boolean

Definition Classes
EdgeParam
def isNode: Boolean

Definition Classes
EdgeParam

Inherited from InParam[N, WkLDiEdge]

Value Members

def isIn: Boolean

Definition Classes
InParam → Param
def isOut: Boolean

Definition Classes
InParam → Param

Inherited from Param[N, WkLDiEdge]

Value Members

def isDefined: Boolean

Definition Classes
Param

Inherited from EdgeLike[N]

Value Members

final def _1: N
The first node.
The first node. Same as _n(0).

Definition Classes
EdgeLike
Annotations
@inline()
def _2: N
The second node.
The second node. Same as _n(1).

Definition Classes
EdgeLike
def _n(n: Int): N
The n'th node with 0 <= n < arity.
The n'th node with 0 <= n < arity.

Definition Classes
EdgeLike
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
def brackets: Brackets

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

Definition Classes
EdgeLike → IterableLike → Equals
final def contains[M >: N](node: M): Boolean
Same as isAt.
Same as isAt.

Definition Classes
EdgeLike
Annotations
@inline()
def equals(other: Any): Boolean

Definition Classes
EdgeLike → Equals → AnyRef → Any
final def isDirected: Boolean
Same as directed.
Same as directed.

Definition Classes
EdgeLike
Annotations
@inline()
def isLabeled: Boolean
true if this edge is labeled.
true if this edge is labeled. See also label.

Definition Classes
EdgeLike
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
final def isUndirected: Boolean
Same as undirected.
Same as undirected.

Definition Classes
EdgeLike
Annotations
@inline()
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
def isValidCustomExceptionMessage: String

Attributes
protected
Definition Classes
EdgeLike
def nodeSeq: Seq[N]
Sequence of the end points of this edge.
Sequence of the end points of this edge.

Definition Classes
EdgeLike
def nodesToString: String

Attributes
protected
Definition Classes
EdgeLike
def nodesToStringWithParenthesis: Boolean

Attributes
protected
Definition Classes
EdgeLike
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()
final def nonLooping: Boolean
Same as ! looping.
Same as ! looping.

Definition Classes
EdgeLike
def sources: Traversable[N]
All source ends of this edge.
All source ends of this edge.

Definition Classes
EdgeLike
def stringPrefix: String

Definition Classes
EdgeLike → TraversableLike → GenTraversableLike
def targets: Traversable[N]
All target ends of this edge.
All target ends of this edge.

Definition Classes
EdgeLike
final def thisSimpleClassName: String

Attributes
protected
Definition Classes
EdgeLike
def toString(): String

Definition Classes
EdgeLike → TraversableLike → AnyRef → Any
def toStringWithParenthesis: Boolean

Attributes
protected
Definition Classes
EdgeLike
final def undirected: Boolean
true if this edge is undirected.
true if this edge is undirected.

Definition Classes
EdgeLike
Annotations
@inline()
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.

Inherited from Iterable[N]

Value Members

def companion: GenericCompanion[Iterable]

Definition Classes
Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
def seq: Iterable[N]

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

Inherited from IterableLike[N, Iterable[N]]

Value Members

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

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def drop(n: Int): Iterable[N]

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

Definition Classes
IterableLike
def exists(p: (N) ⇒ Boolean): Boolean

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def find(p: (N) ⇒ Boolean): Option[N]

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def foldRight[B](z: B)(op: (N, B) ⇒ B): B

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

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

Definition Classes
IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
def grouped(size: Int): Iterator[Iterable[N]]

Definition Classes
IterableLike
def head: N

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def isEmpty: Boolean

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
def reduceRight[B >: N](op: (N, B) ⇒ B): B

Definition Classes
IterableLike → TraversableOnce → GenTraversableOnce
def sameElements[B >: N](that: GenIterable[B]): Boolean

Definition Classes
IterableLike → GenIterableLike
def slice(from: Int, until: Int): Iterable[N]

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

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

Definition Classes
IterableLike
def take(n: Int): Iterable[N]

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

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

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
def thisCollection: Iterable[N]

Attributes
protected[this]
Definition Classes
IterableLike → TraversableLike
def toCollection(repr: Iterable[N]): Iterable[N]

Attributes
protected[this]
Definition Classes
IterableLike → TraversableLike
def toIterable: Iterable[N]

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

Definition Classes
IterableLike → TraversableLike → GenTraversableOnce
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def toStream: Stream[N]

Definition Classes
IterableLike → TraversableLike → GenTraversableOnce
def view(from: Int, until: Int): IterableView[N, Iterable[N]]

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

Definition Classes
IterableLike → TraversableLike
def zip[A1 >: N, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[N], (A1, B), That]): That

Definition Classes
IterableLike → GenIterableLike
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
def zipWithIndex[A1 >: N, That](implicit bf: CanBuildFrom[Iterable[N], (A1, Int), That]): That

Definition Classes
IterableLike → GenIterableLike

Inherited from GenericTraversableTemplate[N, Iterable]

Value Members

def flatten[B](implicit asTraversable: (N) ⇒ GenTraversableOnce[B]): Iterable[B]

Definition Classes
GenericTraversableTemplate
def genericBuilder[B]: Builder[B, Iterable[B]]

Definition Classes
GenericTraversableTemplate
def newBuilder: Builder[N, Iterable[N]]

Attributes
protected[this]
Definition Classes
GenericTraversableTemplate → HasNewBuilder
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.
def unzip[A1, A2](implicit asPair: (N) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

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

Definition Classes
GenericTraversableTemplate

Inherited from TraversableLike[N, Iterable[N]]

Value Members

def ++[B >: N, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That

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

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

Definition Classes
TraversableLike
def collect[B, That](pf: PartialFunction[N, B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def dropWhile(p: (N) ⇒ Boolean): Iterable[N]

Definition Classes
TraversableLike → GenTraversableLike
def filter(p: (N) ⇒ Boolean): Iterable[N]

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

Definition Classes
TraversableLike → GenTraversableLike
def flatMap[B, That](f: (N) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
def groupBy[K](f: (N) ⇒ K): Map[K, Iterable[N]]

Definition Classes
TraversableLike → GenTraversableLike
def hasDefiniteSize: Boolean

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def headOption: Option[N]

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

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

Definition Classes
TraversableLike
final def isTraversableAgain: Boolean

Definition Classes
TraversableLike → GenTraversableLike → GenTraversableOnce
def last: N

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

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

Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
def parCombiner: Combiner[N, ParIterable[N]]

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

Definition Classes
TraversableLike → GenTraversableLike
def repr: Iterable[N]

Definition Classes
TraversableLike → GenTraversableLike
def scan[B >: N, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[N], B, That]): That

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

Definition Classes
TraversableLike → GenTraversableLike
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.
def span(p: (N) ⇒ Boolean): (Iterable[N], Iterable[N])

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

Definition Classes
TraversableLike → GenTraversableLike
def tail: Iterable[N]

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

Definition Classes
TraversableLike
def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, N, Col[N]]): Col[N]

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def toTraversable: Traversable[N]

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def withFilter(p: (N) ⇒ Boolean): FilterMonadic[N, Iterable[N]]

Definition Classes
TraversableLike → FilterMonadic

Inherited from Parallelizable[N, ParIterable[N]]

Value Members

def par: ParIterable[N]

Definition Classes
Parallelizable

Inherited from TraversableOnce[N]

Value Members

def /:[B](z: B)(op: (B, N) ⇒ B): B

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

Definition Classes
TraversableOnce → GenTraversableOnce
def addString(b: StringBuilder): StringBuilder

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

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

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

Definition Classes
TraversableOnce → GenTraversableOnce
def collectFirst[B](pf: PartialFunction[N, B]): Option[B]

Definition Classes
TraversableOnce
def copyToArray[B >: N](xs: Array[B]): Unit

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

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

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

Definition Classes
TraversableOnce → GenTraversableOnce
def fold[A1 >: N](z: A1)(op: (A1, A1) ⇒ A1): A1

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

Definition Classes
TraversableOnce → GenTraversableOnce
def max[B >: N](implicit cmp: Ordering[B]): N

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

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

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

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString: String

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

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

Definition Classes
TraversableOnce → GenTraversableOnce
def nonEmpty: Boolean

Definition Classes
TraversableOnce → GenTraversableOnce
def product[B >: N](implicit num: Numeric[B]): B

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

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

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

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

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

Definition Classes
TraversableOnce → GenTraversableOnce
def reversed: List[N]

Attributes
protected[this]
Definition Classes
TraversableOnce
def sum[B >: N](implicit num: Numeric[B]): B

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

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

Definition Classes
TraversableOnce → GenTraversableOnce
def toIndexedSeq: IndexedSeq[N]

Definition Classes
TraversableOnce → GenTraversableOnce
def toList: List[N]

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

Definition Classes
TraversableOnce → GenTraversableOnce
def toSeq: Seq[N]

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

Definition Classes
TraversableOnce → GenTraversableOnce
def toVector: Vector[N]

Definition Classes
TraversableOnce → GenTraversableOnce

Inherited from GenTraversableOnce[N]

Value Members

def sizeHintIfCheap: Int

Attributes
protected[scala.collection]
Definition Classes
GenTraversableOnce

Inherited from AnyRef

Value Members

final def !=(arg0: Any): Boolean

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

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@native() @throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
Annotations
@native()
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
Annotations
@native()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@native()
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@native() @throws( ... )

Inherited from Any

Value Members

final def asInstanceOf[T0]: T0

Definition Classes
Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any

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

Value Members

val value: WkLDiEdge[N]

Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[N]] performed by method anyToNode in scalax.collection.GraphPredef.
Definition Classes
OuterNode → NodeParam
def isDefined: Boolean
Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[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:
(wkLDiEdge: OuterNode[WkLDiEdge[N]]).isDefined
Definition Classes
Param
def isEdge: Boolean
Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[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:
(wkLDiEdge: OuterNode[WkLDiEdge[N]]).isEdge
Definition Classes
NodeParam
def isIn: Boolean
Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[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:
(wkLDiEdge: OuterNode[WkLDiEdge[N]]).isIn
Definition Classes
InParam → Param
def isNode: Boolean
Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[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:
(wkLDiEdge: OuterNode[WkLDiEdge[N]]).isNode
Definition Classes
NodeParam
def isOut: Boolean
Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[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:
(wkLDiEdge: OuterNode[WkLDiEdge[N]]).isOut
Definition Classes
InParam → Param
def stringPrefix: String
Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[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:
(wkLDiEdge: OuterNode[WkLDiEdge[N]]).stringPrefix
Definition Classes
NodeParam
def toString(): String
Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[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:
(wkLDiEdge: OuterNode[WkLDiEdge[N]]).toString()
Definition Classes
NodeParam → AnyRef → Any

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

Value Members

def toParArray: ParArray[T]

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

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

Value Members

def filter(p: (N) ⇒ Boolean): TraversableOnce[N]
Implicit
This member is added by an implicit conversion from WkLDiEdge[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:
(wkLDiEdge: MonadOps[N]).filter(p)
Definition Classes
MonadOps
def flatMap[B](f: (N) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
Implicit
This member is added by an implicit conversion from WkLDiEdge[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:
(wkLDiEdge: MonadOps[N]).flatMap(f)
Definition Classes
MonadOps
def map[B](f: (N) ⇒ B): TraversableOnce[B]
Implicit
This member is added by an implicit conversion from WkLDiEdge[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:
(wkLDiEdge: MonadOps[N]).map(f)
Definition Classes
MonadOps
def withFilter(p: (N) ⇒ Boolean): Iterator[N]
Implicit
This member is added by an implicit conversion from WkLDiEdge[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:
(wkLDiEdge: MonadOps[N]).withFilter(p)
Definition Classes
MonadOps

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

Value Members

val e: EdgeLikeIn[N]

Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to HyperEdgeAssoc[N] performed by method HyperEdgeAssoc in scalax.collection.GraphPredef.
Definition Classes
HyperEdgeAssoc
def ~[N >: NOld](n: N)(implicit endpointsKind: CollectionKind = Bag): HyperEdge[N]

Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to HyperEdgeAssoc[N] performed by method HyperEdgeAssoc in scalax.collection.GraphPredef.
Definition Classes
HyperEdgeAssoc
def ~>[N >: NOld](n: N)(implicit targetsKind: CollectionKind = Bag): DiHyperEdge[N]

Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to HyperEdgeAssoc[N] performed by method HyperEdgeAssoc in scalax.collection.GraphPredef.
Definition Classes
HyperEdgeAssoc

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

Value Members

val n1: WkLDiEdge[N]

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

Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to EdgeAssoc[WkLDiEdge[N]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
Definition Classes
EdgeAssoc
Annotations
@inline()
def ~>[N >: N1](n2: N): DiEdge[N]

Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to EdgeAssoc[WkLDiEdge[N]] performed by method EdgeAssoc in scalax.collection.GraphPredef.
Definition Classes
EdgeAssoc
Annotations
@inline()

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

Value Members

def +(other: String): String

Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to any2stringadd[WkLDiEdge[N]] performed by method any2stringadd in scala.Predef.
Definition Classes
any2stringadd

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

Value Members

def formatted(fmtstr: String): String

Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to StringFormat[WkLDiEdge[N]] performed by method StringFormat in scala.Predef.
Definition Classes
StringFormat
Annotations
@inline()

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

Value Members

def ensuring(cond: (WkLDiEdge[N]) ⇒ Boolean, msg: ⇒ Any): WkLDiEdge[N]

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

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

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

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

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

Value Members

def ->[B](y: B): (WkLDiEdge[N], B)

Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to ArrowAssoc[WkLDiEdge[N]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@inline()
def →[B](y: B): (WkLDiEdge[N], B)

Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to ArrowAssoc[WkLDiEdge[N]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc

Ungrouped

class EdgeException extends Exception

Attributes
protected
Definition Classes
EdgeLike
abstract type L1

Definition Classes
LEdge
type Self = Iterable[N]

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

Definition Classes
TraversableLike

final def !=(arg0: Any): Boolean

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

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

Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to any2stringadd[WkLDiEdge[N]] performed by method any2stringadd in scala.Predef.
Definition Classes
any2stringadd
def ++[B >: N, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[N], B, That]): That

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

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

Definition Classes
TraversableLike
def ->[B](y: B): (WkLDiEdge[N], B)

Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to ArrowAssoc[WkLDiEdge[N]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@inline()
def /:[B](z: B)(op: (B, N) ⇒ B): B

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

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

Definition Classes
AnyRef → Any
final def _1: N
The first node.
The first node. Same as _n(0).

Definition Classes
EdgeLike
Annotations
@inline()
def _2: N
The second node.
The second node. Same as _n(1).

Definition Classes
EdgeLike
def _n(n: Int): N
The n'th node with 0 <= n < arity.
The n'th node with 0 <= n < arity.

Definition Classes
EdgeLike
def addString(b: StringBuilder): StringBuilder

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

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

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

Definition Classes
TraversableOnce → GenTraversableOnce
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
final def asInstanceOf[T0]: T0

Definition Classes
Any
def attributesToString: String

Attributes
protected
Definition Classes
WLEdge → LEdge → WEdge
final def baseEquals(other: EdgeLike[_]): Boolean

Attributes
protected
Definition Classes
EqDi → Eq
def baseHashCode: Int

Attributes
protected
Definition Classes
EqDi → Eq
def brackets: Brackets

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

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

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

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

Definition Classes
TraversableOnce
def companion: GenericCompanion[Iterable]

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

Definition Classes
EdgeLike
Annotations
@inline()
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
def copyToArray[B >: N](xs: Array[B], start: Int, len: Int): Unit

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

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

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

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

Definition Classes
TraversableOnce → GenTraversableOnce
final def diBaseEquals(n1: Any, n2: Any): Boolean

Attributes
protected
Definition Classes
EqDi
Annotations
@inline()
final def directed: Boolean
true if this edge is directed.
true if this edge is directed.

Definition Classes
DiHyperEdgeLike → EdgeLike
Annotations
@inline()
def drop(n: Int): Iterable[N]

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

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

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

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

Definition Classes
OuterEdge
def ensuring(cond: (WkLDiEdge[N]) ⇒ Boolean, msg: ⇒ Any): WkLDiEdge[N]

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

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

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

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

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

Attributes
protected
Definition Classes
WkEdge
def equals(other: Any): Boolean

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

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

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

Definition Classes
TraversableLike → GenTraversableLike
def finalize(): Unit

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

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

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

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

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

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

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

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

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

Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to StringFormat[WkLDiEdge[N]] performed by method StringFormat in scala.Predef.
Definition Classes
StringFormat
Annotations
@inline()
final def from: N
Synonym for source.
Synonym for source.

Definition Classes
DiHyperEdgeLike
Annotations
@inline()
def genericBuilder[B]: Builder[B, Iterable[B]]

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

Definition Classes
AnyRef → Any
Annotations
@native()
def groupBy[K](f: (N) ⇒ K): Map[K, Iterable[N]]

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

Definition Classes
IterableLike
def hasDefiniteSize: Boolean

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
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
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
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
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
def hashCode(): Int

Definition Classes
WkEdge → AnyRef → Any
def head: N

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

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

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

Definition Classes
TraversableLike
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
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
def isDefined: Boolean

Definition Classes
Param
final def isDirected: Boolean
Same as directed.
Same as directed.

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

Definition Classes
EdgeParam
def isEmpty: Boolean

Definition Classes
IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
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()
def isIn: Boolean

Definition Classes
InParam → Param
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isLabeled: Boolean
true if this edge is labeled.
true if this edge is labeled. See also label.

Definition Classes
EdgeLike
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
def isNode: Boolean

Definition Classes
EdgeParam
def isOut: Boolean

Definition Classes
InParam → Param
final def isTraversableAgain: Boolean

Definition Classes
TraversableLike → GenTraversableLike → GenTraversableOnce
final def isUndirected: Boolean
Same as undirected.
Same as undirected.

Definition Classes
EdgeLike
Annotations
@inline()
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()
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
def isValidCustomExceptionMessage: String

Attributes
protected
Definition Classes
EdgeLike
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
def label: L1

Definition Classes
LEdge
def last: N

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

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

Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
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
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
final def matches(fList: List[(N) ⇒ Boolean]): Boolean

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

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

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

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

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString: String

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

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

Definition Classes
TraversableOnce → GenTraversableOnce
val n1: WkLDiEdge[N]

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

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

Attributes
protected[this]
Definition Classes
GenericTraversableTemplate → HasNewBuilder
def nodeSeq: Seq[N]
Sequence of the end points of this edge.
Sequence of the end points of this edge.

Definition Classes
EdgeLike
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
def nodesToString: String

Attributes
protected
Definition Classes
EdgeLike
def nodesToStringSeparator: String

Attributes
protected
Definition Classes
DiHyperEdgeLike → EdgeLike
def nodesToStringWithParenthesis: Boolean

Attributes
protected
Definition Classes
EdgeLike
def nonEmpty: Boolean

Definition Classes
TraversableOnce → GenTraversableOnce
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()
final def nonLooping: Boolean
Same as ! looping.
Same as ! looping.

Definition Classes
EdgeLike
final def notify(): Unit

Definition Classes
AnyRef
Annotations
@native()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@native()
def par: ParIterable[N]

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

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

Definition Classes
TraversableLike → GenTraversableLike
def product[B >: N](implicit num: Numeric[B]): B

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

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

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

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

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

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

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

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

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

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

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

Definition Classes
TraversableLike → GenTraversableLike
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.
def seq: Iterable[N]

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

Definition Classes
UnDiEdge → GenTraversableLike → TraversableOnce → GenTraversableOnce
Annotations
@inline()
def sizeHintIfCheap: Int

Attributes
protected[scala.collection]
Definition Classes
GenTraversableOnce
def slice(from: Int, until: Int): Iterable[N]

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

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

Definition Classes
IterableLike
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()
def sources: Traversable[N]
All source ends of this edge.
All source ends of this edge.

Definition Classes
EdgeLike
def span(p: (N) ⇒ Boolean): (Iterable[N], Iterable[N])

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

Definition Classes
TraversableLike → GenTraversableLike
def stringPrefix: String

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

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

Definition Classes
AnyRef
def tail: Iterable[N]

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

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

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

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

Definition Classes
IterableLike → TraversableLike → GenTraversableLike
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()
def targets: Traversable[N]
All target ends of this edge.
All target ends of this edge.

Definition Classes
EdgeLike
def thisCollection: Iterable[N]

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

Attributes
protected
Definition Classes
EdgeLike
final def to: N
Synonym for target.
Synonym for target.

Definition Classes
DiEdgeLike → DiHyperEdgeLike
Annotations
@inline()
def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, N, Col[N]]): Col[N]

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

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

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

Attributes
protected[this]
Definition Classes
IterableLike → TraversableLike
def toIndexedSeq: IndexedSeq[N]

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

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

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

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

Definition Classes
TraversableOnce → GenTraversableOnce
def toParArray: ParArray[T]

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

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

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

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

Definition Classes
EdgeLike → TraversableLike → AnyRef → Any
def toStringWithParenthesis: Boolean

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

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

Definition Classes
TraversableOnce → GenTraversableOnce
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.
final def unDiBaseEquals(n1: Any, n2: Any): Boolean

Attributes
protected
Definition Classes
EqUnDi
Annotations
@inline()
final def undirected: Boolean
true if this edge is undirected.
true if this edge is undirected.

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

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

Definition Classes
GenericTraversableTemplate
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.
val value: WkLDiEdge[N]

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

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

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

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

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

Definition Classes
AnyRef
Annotations
@native() @throws( ... )
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
def withFilter(p: (N) ⇒ Boolean): FilterMonadic[N, Iterable[N]]

Definition Classes
TraversableLike → FilterMonadic
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
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
def zip[A1 >: N, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[N], (A1, B), That]): That

Definition Classes
IterableLike → GenIterableLike
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
def zipWithIndex[A1 >: N, That](implicit bf: CanBuildFrom[Iterable[N], (A1, Int), That]): That

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

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

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

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

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

Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to ArrowAssoc[WkLDiEdge[N]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
def filter(p: (N) ⇒ Boolean): TraversableOnce[N]
Implicit
This member is added by an implicit conversion from WkLDiEdge[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:
(wkLDiEdge: MonadOps[N]).filter(p)
Definition Classes
MonadOps
def flatMap[B](f: (N) ⇒ GenTraversableOnce[B]): TraversableOnce[B]
Implicit
This member is added by an implicit conversion from WkLDiEdge[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:
(wkLDiEdge: MonadOps[N]).flatMap(f)
Definition Classes
MonadOps
def isDefined: Boolean
Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[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:
(wkLDiEdge: OuterNode[WkLDiEdge[N]]).isDefined
Definition Classes
Param
def isEdge: Boolean
Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[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:
(wkLDiEdge: OuterNode[WkLDiEdge[N]]).isEdge
Definition Classes
NodeParam
def isIn: Boolean
Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[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:
(wkLDiEdge: OuterNode[WkLDiEdge[N]]).isIn
Definition Classes
InParam → Param
def isNode: Boolean
Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[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:
(wkLDiEdge: OuterNode[WkLDiEdge[N]]).isNode
Definition Classes
NodeParam
def isOut: Boolean
Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[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:
(wkLDiEdge: OuterNode[WkLDiEdge[N]]).isOut
Definition Classes
InParam → Param
def map[B](f: (N) ⇒ B): TraversableOnce[B]
Implicit
This member is added by an implicit conversion from WkLDiEdge[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:
(wkLDiEdge: MonadOps[N]).map(f)
Definition Classes
MonadOps
def stringPrefix: String
Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[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:
(wkLDiEdge: OuterNode[WkLDiEdge[N]]).stringPrefix
Definition Classes
NodeParam
def toString(): String
Implicit
This member is added by an implicit conversion from WkLDiEdge[N] to OuterNode[WkLDiEdge[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:
(wkLDiEdge: OuterNode[WkLDiEdge[N]]).toString()
Definition Classes
NodeParam → AnyRef → Any
def withFilter(p: (N) ⇒ Boolean): Iterator[N]
Implicit
This member is added by an implicit conversion from WkLDiEdge[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:
(wkLDiEdge: MonadOps[N]).withFilter(p)
Definition Classes
MonadOps

Packages

WkLDiEdge 

Companion object WkLDiEdge

abstract class WkLDiEdge[+N] extends WkLUnDiEdge[N] with DiEdgeLike[N] with OuterEdge[N, WkLDiEdge] with EqDi

Instance Constructors

Type Members

Value Members

Shadowed Implicit Value Members

Inherited from DiEdgeLike[N]

Value Members

Inherited from EqDi

Value Members

Inherited from DiHyperEdgeLike[N]

Value Members

Inherited from WkEdge[N]

Value Members

Inherited from WLEdge[N]

Value Members

Inherited from LEdge[N]

Value Members

Inherited from WUnDiEdge[N]

Value Members

Inherited from UnDiEdge[N]

Value Members

Inherited from EqUnDi

Value Members

Inherited from HyperEdge[N]

Value Members

Inherited from OuterEdge[N, WkLDiEdge]

Value Members

Inherited from EdgeParam

Value Members

Inherited from InParam[N, WkLDiEdge]

Value Members

Inherited from Param[N, WkLDiEdge]

Value Members

Inherited from EdgeLike[N]

Value Members

Inherited from Iterable[N]

Value Members

Inherited from IterableLike[N, Iterable[N]]

Value Members

Inherited from GenericTraversableTemplate[N, Iterable]

Value Members

Inherited from TraversableLike[N, Iterable[N]]

Value Members

Inherited from Parallelizable[N, ParIterable[N]]

Value Members

Inherited from TraversableOnce[N]

Value Members

Inherited from GenTraversableOnce[N]

Value Members

Inherited from AnyRef

Value Members

Inherited from Any

Value Members

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

Value Members

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

Value Members

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

Value Members

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

Value Members

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

Value Members

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

Value Members

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

Value Members

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

Value Members

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

Value Members

Ungrouped

WkLDiEdge