InnerDiHyperEdge

Companion object InnerDiHyperEdge

class InnerDiHyperEdge extends DiHyperEdge[CC.NodeT] with CC.EdgeT

Annotations: @SerialVersionUID()

Linear Supertypes

CC.GraphInnerEdge, CC.BaseInnerEdge, CC.InnerEdge, CC.InnerElem, InnerEdgeLike[CC.NodeT], DiHyperEdge[CC.NodeT], AnyDiHyperEdge[CC.NodeT], EqDiHyper, AnyHyperEdge[CC.NodeT], EqHyper, Eq, Edge[CC.NodeT], Equals, AnyRef, Any

Type Hierarchy

Ordering

Alphabetic
By Inheritance

Inherited

InnerDiHyperEdge
GraphInnerEdge
BaseInnerEdge
InnerEdge
InnerElem
InnerEdgeLike
DiHyperEdge
AnyDiHyperEdge
EqDiHyper
AnyHyperEdge
EqHyper
Eq
Edge
Equals
AnyRef
Any

Implicitly

by toOuterEdge
by any2stringadd
by StringFormat
by Ensuring
by ArrowAssoc

Hide All
Show All

Visibility

Public
Protected

Instance Constructors

new InnerDiHyperEdge(sources: OneOrMore[CC.NodeT], targets: OneOrMore[CC.NodeT], outer: E)

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 CC.InnerDiHyperEdge toany2stringadd[CC.InnerDiHyperEdge] performed by method any2stringadd in scala.Predef.
Definition Classes
any2stringadd
def ->[B](y: B): (CC.InnerDiHyperEdge, B)
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toArrowAssoc[CC.InnerDiHyperEdge] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@inline()
final def ==(arg0: Any): Boolean
Definition Classes
AnyRef → Any
def adjacents: Set[CC.EdgeT]
All connecting edges, that is all edges with ends incident with this edge including possible loops.
All connecting edges, that is all edges with ends incident with this edge including possible loops.
Definition Classes
BaseInnerEdge
def arity: Int
Number of the endpoints of this edge.
Number of the endpoints of this edge. At least two nodes are joined. In case of a hook, the two nodes are identical. Hyperedges may link more than two nodes.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge
final def asEdgeT: CC.EdgeT
Attributes
protected[collection]
Definition Classes
GraphInnerEdge → InnerEdge
final def asInstanceOf[T0]: T0
Definition Classes
Any
def baseEquals(other: Edge[_]): Boolean
Attributes
protected
Definition Classes
EqDiHyper → Eq
def baseHashCode: Int
Attributes
protected
Definition Classes
EqDiHyper → Eq
def canEqual(that: Any): Boolean
Definition Classes
BaseInnerEdge → Edge → Equals
def clone(): AnyRef
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
final def containingGraph: CC.ThisGraph
The Graph instance that contains this inner edge.
The Graph instance that contains this inner edge.
Definition Classes
GraphInnerEdge
final def contains[M >: CC.NodeT](node: M): Boolean
Same as isAt.
Same as isAt.
Definition Classes
Edge
Annotations
@inline()
def customMsgPrefix: String
Attributes
protected
Definition Classes
Edge
def ends: Several[CC.NodeT]
The endpoints of this edge, in other words the nodes this edge connects.
The endpoints of this edge, in other words the nodes this edge connects.
Definition Classes
AnyDiHyperEdge → Edge
def ensuring(cond: (CC.InnerDiHyperEdge) => Boolean, msg: => Any): CC.InnerDiHyperEdge
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toEnsuring[CC.InnerDiHyperEdge] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: (CC.InnerDiHyperEdge) => Boolean): CC.InnerDiHyperEdge
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toEnsuring[CC.InnerDiHyperEdge] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean, msg: => Any): CC.InnerDiHyperEdge
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toEnsuring[CC.InnerDiHyperEdge] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean): CC.InnerDiHyperEdge
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toEnsuring[CC.InnerDiHyperEdge] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def equals(other: Any): Boolean
Definition Classes
BaseInnerEdge → Equals → AnyRef → Any
def equals(other: Edge[_]): Boolean
Preconditions: this.directed == that.directed && this.isInstanceOf[Keyed] == that.isInstanceOf[Keyed]
Preconditions: this.directed == that.directed && this.isInstanceOf[Keyed] == that.isInstanceOf[Keyed]
Attributes
protected
Definition Classes
Eq
final def getClass(): Class[_ <: AnyRef]
Definition Classes
AnyRef → Any
Annotations
@native() @HotSpotIntrinsicCandidate()
def hasSource(pred: (CC.NodeT) => Boolean): Boolean
true if any source end of this edge fulfills pred.
true if any source end of this edge fulfills pred.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge
def hasSource[M >: CC.NodeT](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
AnyDiHyperEdge → AnyHyperEdge → Edge
def hasTarget(pred: (CC.NodeT) => Boolean): Boolean
true if any target end of this edge fulfills pred.
true if any target end of this edge fulfills pred.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge
def hasTarget[M >: CC.NodeT](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
AnyDiHyperEdge → AnyHyperEdge → Edge
def hashCode(): Int
Definition Classes
BaseInnerEdge → AnyRef → Any
def isAt(pred: (CC.NodeT) => Boolean): Boolean
true if any end of this edge fulfills pred.
true if any end of this edge fulfills pred.
Definition Classes
AnyHyperEdge → Edge
def isAt[M >: CC.NodeT](node: M): Boolean
true if node is incident with this edge.
true if node is incident with this edge.
Definition Classes
AnyHyperEdge → Edge
final def isDirected: Boolean
Whether this edge is directed.
Whether this edge is directed.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge
Annotations
@inline()
def isHyperEdge: Boolean
Whether this edge's type is hyperedge meaning that it may have more than two ends.
Whether this edge's type is hyperedge meaning that it may have more than two ends.
Definition Classes
AnyHyperEdge → Edge
final def isInstanceOf[T0]: Boolean
Definition Classes
Any
def isLabeled: Boolean
Definition Classes
Edge
def isLooping: Boolean
Whether this edge produces a self-loop.
Whether 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 any of the targets is included in the sources. In case of an undirected hyperedge, a loop is given if any of the ends is a duplicate.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge
final def isUndirected: Boolean
Whether this edge is undirected.
Whether this edge is undirected.
Definition Classes
Edge
Annotations
@inline()
def matches(p1: (CC.NodeT) => Boolean, p2: (CC.NodeT) => Boolean): Boolean
true if
a) two distinct ends of this undirected edge exist for which p1 and p2 hold or
b) p1 holds for a source and p2 for a target of this directed edge.
true if
a) two distinct ends of this undirected edge exist for which p1 and p2 hold or
b) p1 holds for a source and p2 for a target of this directed edge.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge
def matches[M >: CC.NodeT](n1: M, n2: M): Boolean
true if
true if
1. being an undirected edge, both n1 and n2 are at this edge
2. being a directed edge, n1 is a source and n2 a target of this edge.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge
final def matches(fList: List[(CC.NodeT) => Boolean]): Boolean
Attributes
protected
Definition Classes
AnyHyperEdge
final def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def node(n: Int): CC.NodeT
The n'th node of this edge.
The n'th node of this edge.
Definition Classes
AnyHyperEdge → Edge
Exceptions thrown
IllegalArgumentException if n does not meet 0 <= n < arity.
def node1: CC.NodeT
The first node of this edge.
The first node of this edge.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge
def node2: CC.NodeT
The second node of this edge.
The second node of this edge.
Definition Classes
AnyHyperEdge → Edge
final def nonHyperEdge: Boolean
Whether this edge has exactly two ends.
Whether this edge has exactly two ends.
Definition Classes
Edge
Annotations
@inline()
final def nonLooping: Boolean
Same as ! looping.
Same as ! looping.
Definition Classes
Edge
Annotations
@inline()
final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
val outer: E
The outer edge as supplied by instantiation or addition.
The outer edge as supplied by instantiation or addition.
Definition Classes
InnerDiHyperEdge → InnerEdge
def privateNodes: Set[CC.NodeT]
The nodes of this edge which only participate in this edge.
The nodes of this edge which only participate in this edge.
Definition Classes
BaseInnerEdge
val sources: OneOrMore[CC.NodeT]
All source ends of this edge.
All source ends of this edge.
Definition Classes
InnerDiHyperEdge → AnyHyperEdge → Edge
final def synchronized[T0](arg0: => T0): T0
Definition Classes
AnyRef
val targets: OneOrMore[CC.NodeT]
All target ends of this edge.
All target ends of this edge.
Definition Classes
InnerDiHyperEdge → AnyHyperEdge → Edge
def toString(): String
Definition Classes
BaseInnerEdge → AnyRef → Any
final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException]) @native()
final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def weight: Double
The weight of this edge with a default of 1.
The weight of this edge with a default of 1.
Note that weight is normally not part of the edge key (hashCode). As a result, edges with different weights connecting the same nodes will be evaluated as equal and thus added once and only once to the graph. In case you need multi-edges based on different weights you should define a custom edge class that mixes in ExtendedKey and adds weight to keyAttributes.
Definition Classes
BaseInnerEdge → Edge
Annotations
@inline()
def withSources[U](f: (CC.NodeT) => U): Unit
Applies f to all source ends of this edge without any memory allocation.
Applies f to all source ends of this edge without any memory allocation.
Definition Classes
AnyHyperEdge → Edge
def withTargets[U](f: (CC.NodeT) => U): Unit
Applies f to the target ends of this edge without any memory allocation.
Applies f to the target ends of this edge without any memory allocation.
Definition Classes
AnyHyperEdge → Edge

Shadowed Implicit Value Members

def arity: Int
Number of the endpoints of this edge.
Number of the endpoints of this edge. At least two nodes are joined. In case of a hook, the two nodes are identical. Hyperedges may link more than two nodes.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).arity
Definition Classes
Edge
def canEqual(that: Any): Boolean
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).canEqual(that)
Definition Classes
Edge → Equals
final def contains[M >: CC.NodeT](node: M): Boolean
Same as isAt.
Same as isAt.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).contains(node)
Definition Classes
Edge
Annotations
@inline()
def ends: Several[N]
The endpoints of this edge, in other words the nodes this edge connects.
The endpoints of this edge, in other words the nodes this edge connects.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).ends
Definition Classes
Edge
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.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).hasSource(pred)
Definition Classes
Edge
def hasSource[M >: CC.NodeT](node: M): Boolean
true if node is a source of this edge.
true if node is a source of this edge. In case this edge is undirected this method maps to isAt.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).hasSource(node)
Definition Classes
Edge
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.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).hasTarget(pred)
Definition Classes
Edge
def hasTarget[M >: CC.NodeT](node: M): Boolean
true if node is a target of this edge.
true if node is a target of this edge. In case this edge is undirected this method maps to isAt.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).hasTarget(node)
Definition Classes
Edge
def isAt(pred: (N) => Boolean): Boolean
true if any end of this edge fulfills pred.
true if any end of this edge fulfills pred.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).isAt(pred)
Definition Classes
Edge
def isAt[M >: CC.NodeT](node: M): Boolean
true if node is incident with this edge.
true if node is incident with this edge.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).isAt(node)
Definition Classes
Edge
def isDirected: Boolean
Whether this edge is directed.
Whether this edge is directed.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).isDirected
Definition Classes
Edge
def isHyperEdge: Boolean
Whether this edge's type is hyperedge meaning that it may have more than two ends.
Whether this edge's type is hyperedge meaning that it may have more than two ends.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).isHyperEdge
Definition Classes
Edge
def isLabeled: Boolean
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).isLabeled
Definition Classes
Edge
def isLooping: Boolean
Whether this edge produces a self-loop.
Whether 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 any of the targets is included in the sources. In case of an undirected hyperedge, a loop is given if any of the ends is a duplicate.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).isLooping
Definition Classes
Edge
final def isUndirected: Boolean
Whether this edge is undirected.
Whether this edge is undirected.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).isUndirected
Definition Classes
Edge
Annotations
@inline()
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.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).matches(p1, p2)
Definition Classes
Edge
def matches[M >: CC.NodeT](n1: M, n2: M): Boolean
true if
true if
1. being an undirected edge, both n1 and n2 are at this edge
2. being a directed edge, n1 is a source and n2 a target of this edge.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).matches(n1, n2)
Definition Classes
Edge
def node(n: Int): N
The n'th node of this edge.
The n'th node of this edge.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).node(n)
Definition Classes
Edge
Exceptions thrown
IllegalArgumentException if n does not meet 0 <= n < arity.
def node1: N
The first node of this edge.
The first node of this edge.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).node1
Definition Classes
Edge
def node2: N
The second node of this edge.
The second node of this edge.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).node2
Definition Classes
Edge
final def nonHyperEdge: Boolean
Whether this edge has exactly two ends.
Whether this edge has exactly two ends.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).nonHyperEdge
Definition Classes
Edge
Annotations
@inline()
final def nonLooping: Boolean
Same as ! looping.
Same as ! looping.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).nonLooping
Definition Classes
Edge
Annotations
@inline()
def sources: OneOrMore[N]
All source ends of this edge.
All source ends of this edge.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).sources
Definition Classes
Edge
def targets: OneOrMore[N]
All target ends of this edge.
All target ends of this edge.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).targets
Definition Classes
Edge
def weight: Double
The weight of this edge with a default of 1.
The weight of this edge with a default of 1.
Note that weight is normally not part of the edge key (hashCode). As a result, edges with different weights connecting the same nodes will be evaluated as equal and thus added once and only once to the graph. In case you need multi-edges based on different weights you should define a custom edge class that mixes in ExtendedKey and adds weight to keyAttributes.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).weight
Definition Classes
Edge
def withSources[U](f: (N) => U): Unit
Applies f to all source ends of this edge without any memory allocation.
Applies f to all source ends of this edge without any memory allocation.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).withSources(f)
Definition Classes
Edge
def withTargets[U](f: (N) => U): Unit
Applies f to the target ends of this edge without any memory allocation.
Applies f to the target ends of this edge without any memory allocation.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).withTargets(f)
Definition Classes
Edge

Deprecated Value Members

def finalize(): Unit
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.Throwable]) @Deprecated @Deprecated
Deprecated
def formatted(fmtstr: String): String
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toStringFormat[CC.InnerDiHyperEdge] performed by method StringFormat in scala.Predef.
Definition Classes
StringFormat
Annotations
@deprecated @inline()
Deprecated
(Since version 2.12.16) Use formatString.format(value) instead of value.formatted(formatString), or use the f"" string interpolator. In Java 15 and later, formatted resolves to the new method in String which has reversed parameters.
def →[B](y: B): (CC.InnerDiHyperEdge, B)
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toArrowAssoc[CC.InnerDiHyperEdge] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Inherited from CC.GraphInnerEdge

Value Members

final def asEdgeT: CC.EdgeT
Attributes
protected[collection]
Definition Classes
GraphInnerEdge → InnerEdge
final def containingGraph: CC.ThisGraph
The Graph instance that contains this inner edge.
The Graph instance that contains this inner edge.
Definition Classes
GraphInnerEdge

Inherited from CC.BaseInnerEdge

Value Members

def adjacents: Set[CC.EdgeT]
All connecting edges, that is all edges with ends incident with this edge including possible loops.
All connecting edges, that is all edges with ends incident with this edge including possible loops.
Definition Classes
BaseInnerEdge
def canEqual(that: Any): Boolean
Definition Classes
BaseInnerEdge → Edge → Equals
def equals(other: Any): Boolean
Definition Classes
BaseInnerEdge → Equals → AnyRef → Any
def hashCode(): Int
Definition Classes
BaseInnerEdge → AnyRef → Any
def privateNodes: Set[CC.NodeT]
The nodes of this edge which only participate in this edge.
The nodes of this edge which only participate in this edge.
Definition Classes
BaseInnerEdge
def toString(): String
Definition Classes
BaseInnerEdge → AnyRef → Any
final def weight: Double
The weight of this edge with a default of 1.
The weight of this edge with a default of 1.
Note that weight is normally not part of the edge key (hashCode). As a result, edges with different weights connecting the same nodes will be evaluated as equal and thus added once and only once to the graph. In case you need multi-edges based on different weights you should define a custom edge class that mixes in ExtendedKey and adds weight to keyAttributes.
Definition Classes
BaseInnerEdge → Edge
Annotations
@inline()

Inherited from AnyDiHyperEdge[CC.NodeT]

Value Members

def arity: Int
Number of the endpoints of this edge.
Number of the endpoints of this edge. At least two nodes are joined. In case of a hook, the two nodes are identical. Hyperedges may link more than two nodes.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge
def ends: Several[CC.NodeT]
The endpoints of this edge, in other words the nodes this edge connects.
The endpoints of this edge, in other words the nodes this edge connects.
Definition Classes
AnyDiHyperEdge → Edge
def hasSource(pred: (CC.NodeT) => Boolean): Boolean
true if any source end of this edge fulfills pred.
true if any source end of this edge fulfills pred.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge
def hasSource[M >: CC.NodeT](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
AnyDiHyperEdge → AnyHyperEdge → Edge
def hasTarget(pred: (CC.NodeT) => Boolean): Boolean
true if any target end of this edge fulfills pred.
true if any target end of this edge fulfills pred.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge
def hasTarget[M >: CC.NodeT](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
AnyDiHyperEdge → AnyHyperEdge → Edge
final def isDirected: Boolean
Whether this edge is directed.
Whether this edge is directed.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge
Annotations
@inline()
def isLooping: Boolean
Whether this edge produces a self-loop.
Whether 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 any of the targets is included in the sources. In case of an undirected hyperedge, a loop is given if any of the ends is a duplicate.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge
def matches(p1: (CC.NodeT) => Boolean, p2: (CC.NodeT) => Boolean): Boolean
true if
a) two distinct ends of this undirected edge exist for which p1 and p2 hold or
b) p1 holds for a source and p2 for a target of this directed edge.
true if
a) two distinct ends of this undirected edge exist for which p1 and p2 hold or
b) p1 holds for a source and p2 for a target of this directed edge.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge
def matches[M >: CC.NodeT](n1: M, n2: M): Boolean
true if
true if
1. being an undirected edge, both n1 and n2 are at this edge
2. being a directed edge, n1 is a source and n2 a target of this edge.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge
def node1: CC.NodeT
The first node of this edge.
The first node of this edge.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge

Inherited from EqDiHyper

Value Members

def baseEquals(other: Edge[_]): Boolean
Attributes
protected
Definition Classes
EqDiHyper → Eq
def baseHashCode: Int
Attributes
protected
Definition Classes
EqDiHyper → Eq

Inherited from AnyHyperEdge[CC.NodeT]

Value Members

def isAt(pred: (CC.NodeT) => Boolean): Boolean
true if any end of this edge fulfills pred.
true if any end of this edge fulfills pred.
Definition Classes
AnyHyperEdge → Edge
def isAt[M >: CC.NodeT](node: M): Boolean
true if node is incident with this edge.
true if node is incident with this edge.
Definition Classes
AnyHyperEdge → Edge
def isHyperEdge: Boolean
Whether this edge's type is hyperedge meaning that it may have more than two ends.
Whether this edge's type is hyperedge meaning that it may have more than two ends.
Definition Classes
AnyHyperEdge → Edge
final def matches(fList: List[(CC.NodeT) => Boolean]): Boolean
Attributes
protected
Definition Classes
AnyHyperEdge
def node(n: Int): CC.NodeT
The n'th node of this edge.
The n'th node of this edge.
Definition Classes
AnyHyperEdge → Edge
Exceptions thrown
IllegalArgumentException if n does not meet 0 <= n < arity.
def node2: CC.NodeT
The second node of this edge.
The second node of this edge.
Definition Classes
AnyHyperEdge → Edge
def withSources[U](f: (CC.NodeT) => U): Unit
Applies f to all source ends of this edge without any memory allocation.
Applies f to all source ends of this edge without any memory allocation.
Definition Classes
AnyHyperEdge → Edge
def withTargets[U](f: (CC.NodeT) => U): Unit
Applies f to the target ends of this edge without any memory allocation.
Applies f to the target ends of this edge without any memory allocation.
Definition Classes
AnyHyperEdge → Edge

Inherited from Eq

Value Members

def equals(other: Edge[_]): Boolean
Preconditions: this.directed == that.directed && this.isInstanceOf[Keyed] == that.isInstanceOf[Keyed]
Preconditions: this.directed == that.directed && this.isInstanceOf[Keyed] == that.isInstanceOf[Keyed]
Attributes
protected
Definition Classes
Eq

Inherited from Edge[CC.NodeT]

Value Members

final def contains[M >: CC.NodeT](node: M): Boolean
Same as isAt.
Same as isAt.
Definition Classes
Edge
Annotations
@inline()
def customMsgPrefix: String
Attributes
protected
Definition Classes
Edge
def isLabeled: Boolean
Definition Classes
Edge
final def isUndirected: Boolean
Whether this edge is undirected.
Whether this edge is undirected.
Definition Classes
Edge
Annotations
@inline()
final def nonHyperEdge: Boolean
Whether this edge has exactly two ends.
Whether this edge has exactly two ends.
Definition Classes
Edge
Annotations
@inline()
final def nonLooping: Boolean
Same as ! looping.
Same as ! looping.
Definition Classes
Edge
Annotations
@inline()

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[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
final def getClass(): Class[_ <: AnyRef]
Definition Classes
AnyRef → Any
Annotations
@native() @HotSpotIntrinsicCandidate()
final def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef
final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
final def synchronized[T0](arg0: => T0): T0
Definition Classes
AnyRef
final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException]) @native()
final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
def finalize(): Unit
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.Throwable]) @Deprecated @Deprecated
Deprecated

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 toOuterEdge fromCC.InnerDiHyperEdge to E

Value Members

def arity: Int
Number of the endpoints of this edge.
Number of the endpoints of this edge. At least two nodes are joined. In case of a hook, the two nodes are identical. Hyperedges may link more than two nodes.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).arity
Definition Classes
Edge
def canEqual(that: Any): Boolean
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).canEqual(that)
Definition Classes
Edge → Equals
final def contains[M >: CC.NodeT](node: M): Boolean
Same as isAt.
Same as isAt.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).contains(node)
Definition Classes
Edge
Annotations
@inline()
def ends: Several[N]
The endpoints of this edge, in other words the nodes this edge connects.
The endpoints of this edge, in other words the nodes this edge connects.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).ends
Definition Classes
Edge
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.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).hasSource(pred)
Definition Classes
Edge
def hasSource[M >: CC.NodeT](node: M): Boolean
true if node is a source of this edge.
true if node is a source of this edge. In case this edge is undirected this method maps to isAt.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).hasSource(node)
Definition Classes
Edge
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.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).hasTarget(pred)
Definition Classes
Edge
def hasTarget[M >: CC.NodeT](node: M): Boolean
true if node is a target of this edge.
true if node is a target of this edge. In case this edge is undirected this method maps to isAt.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).hasTarget(node)
Definition Classes
Edge
def isAt(pred: (N) => Boolean): Boolean
true if any end of this edge fulfills pred.
true if any end of this edge fulfills pred.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).isAt(pred)
Definition Classes
Edge
def isAt[M >: CC.NodeT](node: M): Boolean
true if node is incident with this edge.
true if node is incident with this edge.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).isAt(node)
Definition Classes
Edge
def isDirected: Boolean
Whether this edge is directed.
Whether this edge is directed.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).isDirected
Definition Classes
Edge
def isHyperEdge: Boolean
Whether this edge's type is hyperedge meaning that it may have more than two ends.
Whether this edge's type is hyperedge meaning that it may have more than two ends.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).isHyperEdge
Definition Classes
Edge
def isLabeled: Boolean
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).isLabeled
Definition Classes
Edge
def isLooping: Boolean
Whether this edge produces a self-loop.
Whether 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 any of the targets is included in the sources. In case of an undirected hyperedge, a loop is given if any of the ends is a duplicate.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).isLooping
Definition Classes
Edge
final def isUndirected: Boolean
Whether this edge is undirected.
Whether this edge is undirected.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).isUndirected
Definition Classes
Edge
Annotations
@inline()
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.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).matches(p1, p2)
Definition Classes
Edge
def matches[M >: CC.NodeT](n1: M, n2: M): Boolean
true if
true if
1. being an undirected edge, both n1 and n2 are at this edge
2. being a directed edge, n1 is a source and n2 a target of this edge.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).matches(n1, n2)
Definition Classes
Edge
def node(n: Int): N
The n'th node of this edge.
The n'th node of this edge.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).node(n)
Definition Classes
Edge
Exceptions thrown
IllegalArgumentException if n does not meet 0 <= n < arity.
def node1: N
The first node of this edge.
The first node of this edge.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).node1
Definition Classes
Edge
def node2: N
The second node of this edge.
The second node of this edge.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).node2
Definition Classes
Edge
final def nonHyperEdge: Boolean
Whether this edge has exactly two ends.
Whether this edge has exactly two ends.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).nonHyperEdge
Definition Classes
Edge
Annotations
@inline()
final def nonLooping: Boolean
Same as ! looping.
Same as ! looping.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).nonLooping
Definition Classes
Edge
Annotations
@inline()
def sources: OneOrMore[N]
All source ends of this edge.
All source ends of this edge.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).sources
Definition Classes
Edge
def targets: OneOrMore[N]
All target ends of this edge.
All target ends of this edge.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).targets
Definition Classes
Edge
def weight: Double
The weight of this edge with a default of 1.
The weight of this edge with a default of 1.
Note that weight is normally not part of the edge key (hashCode). As a result, edges with different weights connecting the same nodes will be evaluated as equal and thus added once and only once to the graph. In case you need multi-edges based on different weights you should define a custom edge class that mixes in ExtendedKey and adds weight to keyAttributes.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).weight
Definition Classes
Edge
def withSources[U](f: (N) => U): Unit
Applies f to all source ends of this edge without any memory allocation.
Applies f to all source ends of this edge without any memory allocation.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).withSources(f)
Definition Classes
Edge
def withTargets[U](f: (N) => U): Unit
Applies f to the target ends of this edge without any memory allocation.
Applies f to the target ends of this edge without any memory allocation.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).withTargets(f)
Definition Classes
Edge

Inherited by implicit conversion any2stringadd fromCC.InnerDiHyperEdge to any2stringadd[CC.InnerDiHyperEdge]

Value Members

def +(other: String): String
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toany2stringadd[CC.InnerDiHyperEdge] performed by method any2stringadd in scala.Predef.
Definition Classes
any2stringadd

Inherited by implicit conversion StringFormat fromCC.InnerDiHyperEdge to StringFormat[CC.InnerDiHyperEdge]

Value Members

def formatted(fmtstr: String): String
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toStringFormat[CC.InnerDiHyperEdge] performed by method StringFormat in scala.Predef.
Definition Classes
StringFormat
Annotations
@deprecated @inline()
Deprecated
(Since version 2.12.16) Use formatString.format(value) instead of value.formatted(formatString), or use the f"" string interpolator. In Java 15 and later, formatted resolves to the new method in String which has reversed parameters.

Inherited by implicit conversion Ensuring fromCC.InnerDiHyperEdge to Ensuring[CC.InnerDiHyperEdge]

Value Members

def ensuring(cond: (CC.InnerDiHyperEdge) => Boolean, msg: => Any): CC.InnerDiHyperEdge
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toEnsuring[CC.InnerDiHyperEdge] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: (CC.InnerDiHyperEdge) => Boolean): CC.InnerDiHyperEdge
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toEnsuring[CC.InnerDiHyperEdge] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean, msg: => Any): CC.InnerDiHyperEdge
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toEnsuring[CC.InnerDiHyperEdge] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean): CC.InnerDiHyperEdge
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toEnsuring[CC.InnerDiHyperEdge] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring

Inherited by implicit conversion ArrowAssoc fromCC.InnerDiHyperEdge to ArrowAssoc[CC.InnerDiHyperEdge]

Value Members

def ->[B](y: B): (CC.InnerDiHyperEdge, B)
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toArrowAssoc[CC.InnerDiHyperEdge] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@inline()
def →[B](y: B): (CC.InnerDiHyperEdge, B)
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toArrowAssoc[CC.InnerDiHyperEdge] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Ungrouped

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 CC.InnerDiHyperEdge toany2stringadd[CC.InnerDiHyperEdge] performed by method any2stringadd in scala.Predef.
Definition Classes
any2stringadd
def ->[B](y: B): (CC.InnerDiHyperEdge, B)
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toArrowAssoc[CC.InnerDiHyperEdge] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@inline()
final def ==(arg0: Any): Boolean
Definition Classes
AnyRef → Any
def adjacents: Set[CC.EdgeT]
All connecting edges, that is all edges with ends incident with this edge including possible loops.
All connecting edges, that is all edges with ends incident with this edge including possible loops.
Definition Classes
BaseInnerEdge
def arity: Int
Number of the endpoints of this edge.
Number of the endpoints of this edge. At least two nodes are joined. In case of a hook, the two nodes are identical. Hyperedges may link more than two nodes.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge
final def asEdgeT: CC.EdgeT
Attributes
protected[collection]
Definition Classes
GraphInnerEdge → InnerEdge
final def asInstanceOf[T0]: T0
Definition Classes
Any
def baseEquals(other: Edge[_]): Boolean
Attributes
protected
Definition Classes
EqDiHyper → Eq
def baseHashCode: Int
Attributes
protected
Definition Classes
EqDiHyper → Eq
def canEqual(that: Any): Boolean
Definition Classes
BaseInnerEdge → Edge → Equals
def clone(): AnyRef
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
final def containingGraph: CC.ThisGraph
The Graph instance that contains this inner edge.
The Graph instance that contains this inner edge.
Definition Classes
GraphInnerEdge
final def contains[M >: CC.NodeT](node: M): Boolean
Same as isAt.
Same as isAt.
Definition Classes
Edge
Annotations
@inline()
def customMsgPrefix: String
Attributes
protected
Definition Classes
Edge
def ends: Several[CC.NodeT]
The endpoints of this edge, in other words the nodes this edge connects.
The endpoints of this edge, in other words the nodes this edge connects.
Definition Classes
AnyDiHyperEdge → Edge
def ensuring(cond: (CC.InnerDiHyperEdge) => Boolean, msg: => Any): CC.InnerDiHyperEdge
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toEnsuring[CC.InnerDiHyperEdge] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: (CC.InnerDiHyperEdge) => Boolean): CC.InnerDiHyperEdge
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toEnsuring[CC.InnerDiHyperEdge] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean, msg: => Any): CC.InnerDiHyperEdge
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toEnsuring[CC.InnerDiHyperEdge] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean): CC.InnerDiHyperEdge
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toEnsuring[CC.InnerDiHyperEdge] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def equals(other: Any): Boolean
Definition Classes
BaseInnerEdge → Equals → AnyRef → Any
def equals(other: Edge[_]): Boolean
Preconditions: this.directed == that.directed && this.isInstanceOf[Keyed] == that.isInstanceOf[Keyed]
Preconditions: this.directed == that.directed && this.isInstanceOf[Keyed] == that.isInstanceOf[Keyed]
Attributes
protected
Definition Classes
Eq
final def getClass(): Class[_ <: AnyRef]
Definition Classes
AnyRef → Any
Annotations
@native() @HotSpotIntrinsicCandidate()
def hasSource(pred: (CC.NodeT) => Boolean): Boolean
true if any source end of this edge fulfills pred.
true if any source end of this edge fulfills pred.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge
def hasSource[M >: CC.NodeT](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
AnyDiHyperEdge → AnyHyperEdge → Edge
def hasTarget(pred: (CC.NodeT) => Boolean): Boolean
true if any target end of this edge fulfills pred.
true if any target end of this edge fulfills pred.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge
def hasTarget[M >: CC.NodeT](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
AnyDiHyperEdge → AnyHyperEdge → Edge
def hashCode(): Int
Definition Classes
BaseInnerEdge → AnyRef → Any
def isAt(pred: (CC.NodeT) => Boolean): Boolean
true if any end of this edge fulfills pred.
true if any end of this edge fulfills pred.
Definition Classes
AnyHyperEdge → Edge
def isAt[M >: CC.NodeT](node: M): Boolean
true if node is incident with this edge.
true if node is incident with this edge.
Definition Classes
AnyHyperEdge → Edge
final def isDirected: Boolean
Whether this edge is directed.
Whether this edge is directed.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge
Annotations
@inline()
def isHyperEdge: Boolean
Whether this edge's type is hyperedge meaning that it may have more than two ends.
Whether this edge's type is hyperedge meaning that it may have more than two ends.
Definition Classes
AnyHyperEdge → Edge
final def isInstanceOf[T0]: Boolean
Definition Classes
Any
def isLabeled: Boolean
Definition Classes
Edge
def isLooping: Boolean
Whether this edge produces a self-loop.
Whether 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 any of the targets is included in the sources. In case of an undirected hyperedge, a loop is given if any of the ends is a duplicate.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge
final def isUndirected: Boolean
Whether this edge is undirected.
Whether this edge is undirected.
Definition Classes
Edge
Annotations
@inline()
def matches(p1: (CC.NodeT) => Boolean, p2: (CC.NodeT) => Boolean): Boolean
true if
a) two distinct ends of this undirected edge exist for which p1 and p2 hold or
b) p1 holds for a source and p2 for a target of this directed edge.
true if
a) two distinct ends of this undirected edge exist for which p1 and p2 hold or
b) p1 holds for a source and p2 for a target of this directed edge.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge
def matches[M >: CC.NodeT](n1: M, n2: M): Boolean
true if
true if
1. being an undirected edge, both n1 and n2 are at this edge
2. being a directed edge, n1 is a source and n2 a target of this edge.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge
final def matches(fList: List[(CC.NodeT) => Boolean]): Boolean
Attributes
protected
Definition Classes
AnyHyperEdge
final def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def node(n: Int): CC.NodeT
The n'th node of this edge.
The n'th node of this edge.
Definition Classes
AnyHyperEdge → Edge
Exceptions thrown
IllegalArgumentException if n does not meet 0 <= n < arity.
def node1: CC.NodeT
The first node of this edge.
The first node of this edge.
Definition Classes
AnyDiHyperEdge → AnyHyperEdge → Edge
def node2: CC.NodeT
The second node of this edge.
The second node of this edge.
Definition Classes
AnyHyperEdge → Edge
final def nonHyperEdge: Boolean
Whether this edge has exactly two ends.
Whether this edge has exactly two ends.
Definition Classes
Edge
Annotations
@inline()
final def nonLooping: Boolean
Same as ! looping.
Same as ! looping.
Definition Classes
Edge
Annotations
@inline()
final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
val outer: E
The outer edge as supplied by instantiation or addition.
The outer edge as supplied by instantiation or addition.
Definition Classes
InnerDiHyperEdge → InnerEdge
def privateNodes: Set[CC.NodeT]
The nodes of this edge which only participate in this edge.
The nodes of this edge which only participate in this edge.
Definition Classes
BaseInnerEdge
val sources: OneOrMore[CC.NodeT]
All source ends of this edge.
All source ends of this edge.
Definition Classes
InnerDiHyperEdge → AnyHyperEdge → Edge
final def synchronized[T0](arg0: => T0): T0
Definition Classes
AnyRef
val targets: OneOrMore[CC.NodeT]
All target ends of this edge.
All target ends of this edge.
Definition Classes
InnerDiHyperEdge → AnyHyperEdge → Edge
def toString(): String
Definition Classes
BaseInnerEdge → AnyRef → Any
final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException]) @native()
final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def weight: Double
The weight of this edge with a default of 1.
The weight of this edge with a default of 1.
Note that weight is normally not part of the edge key (hashCode). As a result, edges with different weights connecting the same nodes will be evaluated as equal and thus added once and only once to the graph. In case you need multi-edges based on different weights you should define a custom edge class that mixes in ExtendedKey and adds weight to keyAttributes.
Definition Classes
BaseInnerEdge → Edge
Annotations
@inline()
def withSources[U](f: (CC.NodeT) => U): Unit
Applies f to all source ends of this edge without any memory allocation.
Applies f to all source ends of this edge without any memory allocation.
Definition Classes
AnyHyperEdge → Edge
def withTargets[U](f: (CC.NodeT) => U): Unit
Applies f to the target ends of this edge without any memory allocation.
Applies f to the target ends of this edge without any memory allocation.
Definition Classes
AnyHyperEdge → Edge
def arity: Int
Number of the endpoints of this edge.
Number of the endpoints of this edge. At least two nodes are joined. In case of a hook, the two nodes are identical. Hyperedges may link more than two nodes.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).arity
Definition Classes
Edge
def canEqual(that: Any): Boolean
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).canEqual(that)
Definition Classes
Edge → Equals
final def contains[M >: CC.NodeT](node: M): Boolean
Same as isAt.
Same as isAt.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).contains(node)
Definition Classes
Edge
Annotations
@inline()
def ends: Several[N]
The endpoints of this edge, in other words the nodes this edge connects.
The endpoints of this edge, in other words the nodes this edge connects.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).ends
Definition Classes
Edge
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.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).hasSource(pred)
Definition Classes
Edge
def hasSource[M >: CC.NodeT](node: M): Boolean
true if node is a source of this edge.
true if node is a source of this edge. In case this edge is undirected this method maps to isAt.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).hasSource(node)
Definition Classes
Edge
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.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).hasTarget(pred)
Definition Classes
Edge
def hasTarget[M >: CC.NodeT](node: M): Boolean
true if node is a target of this edge.
true if node is a target of this edge. In case this edge is undirected this method maps to isAt.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).hasTarget(node)
Definition Classes
Edge
def isAt(pred: (N) => Boolean): Boolean
true if any end of this edge fulfills pred.
true if any end of this edge fulfills pred.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).isAt(pred)
Definition Classes
Edge
def isAt[M >: CC.NodeT](node: M): Boolean
true if node is incident with this edge.
true if node is incident with this edge.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).isAt(node)
Definition Classes
Edge
def isDirected: Boolean
Whether this edge is directed.
Whether this edge is directed.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).isDirected
Definition Classes
Edge
def isHyperEdge: Boolean
Whether this edge's type is hyperedge meaning that it may have more than two ends.
Whether this edge's type is hyperedge meaning that it may have more than two ends.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).isHyperEdge
Definition Classes
Edge
def isLabeled: Boolean
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).isLabeled
Definition Classes
Edge
def isLooping: Boolean
Whether this edge produces a self-loop.
Whether 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 any of the targets is included in the sources. In case of an undirected hyperedge, a loop is given if any of the ends is a duplicate.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).isLooping
Definition Classes
Edge
final def isUndirected: Boolean
Whether this edge is undirected.
Whether this edge is undirected.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).isUndirected
Definition Classes
Edge
Annotations
@inline()
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.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).matches(p1, p2)
Definition Classes
Edge
def matches[M >: CC.NodeT](n1: M, n2: M): Boolean
true if
true if
1. being an undirected edge, both n1 and n2 are at this edge
2. being a directed edge, n1 is a source and n2 a target of this edge.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).matches(n1, n2)
Definition Classes
Edge
def node(n: Int): N
The n'th node of this edge.
The n'th node of this edge.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).node(n)
Definition Classes
Edge
Exceptions thrown
IllegalArgumentException if n does not meet 0 <= n < arity.
def node1: N
The first node of this edge.
The first node of this edge.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).node1
Definition Classes
Edge
def node2: N
The second node of this edge.
The second node of this edge.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).node2
Definition Classes
Edge
final def nonHyperEdge: Boolean
Whether this edge has exactly two ends.
Whether this edge has exactly two ends.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).nonHyperEdge
Definition Classes
Edge
Annotations
@inline()
final def nonLooping: Boolean
Same as ! looping.
Same as ! looping.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).nonLooping
Definition Classes
Edge
Annotations
@inline()
def sources: OneOrMore[N]
All source ends of this edge.
All source ends of this edge.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).sources
Definition Classes
Edge
def targets: OneOrMore[N]
All target ends of this edge.
All target ends of this edge.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).targets
Definition Classes
Edge
def weight: Double
The weight of this edge with a default of 1.
The weight of this edge with a default of 1.
Note that weight is normally not part of the edge key (hashCode). As a result, edges with different weights connecting the same nodes will be evaluated as equal and thus added once and only once to the graph. In case you need multi-edges based on different weights you should define a custom edge class that mixes in ExtendedKey and adds weight to keyAttributes.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).weight
Definition Classes
Edge
def withSources[U](f: (N) => U): Unit
Applies f to all source ends of this edge without any memory allocation.
Applies f to all source ends of this edge without any memory allocation.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).withSources(f)
Definition Classes
Edge
def withTargets[U](f: (N) => U): Unit
Applies f to the target ends of this edge without any memory allocation.
Applies f to the target ends of this edge without any memory allocation.
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toE performed by method toOuterEdge in scalax.collection.GraphBase.BaseInnerEdge.
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:
(innerDiHyperEdge: E).withTargets(f)
Definition Classes
Edge
def finalize(): Unit
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.Throwable]) @Deprecated @Deprecated
Deprecated
def formatted(fmtstr: String): String
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toStringFormat[CC.InnerDiHyperEdge] performed by method StringFormat in scala.Predef.
Definition Classes
StringFormat
Annotations
@deprecated @inline()
Deprecated
(Since version 2.12.16) Use formatString.format(value) instead of value.formatted(formatString), or use the f"" string interpolator. In Java 15 and later, formatted resolves to the new method in String which has reversed parameters.
def →[B](y: B): (CC.InnerDiHyperEdge, B)
Implicit
This member is added by an implicit conversion from CC.InnerDiHyperEdge toArrowAssoc[CC.InnerDiHyperEdge] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Packages

InnerDiHyperEdge

Companion object InnerDiHyperEdge

class InnerDiHyperEdge extends DiHyperEdge[CC.NodeT] with CC.EdgeT

Instance Constructors

Value Members

Shadowed Implicit Value Members

Deprecated Value Members

Inherited from CC.GraphInnerEdge

Value Members

Inherited from CC.BaseInnerEdge

Value Members

Inherited from AnyDiHyperEdge[CC.NodeT]

Value Members

Inherited from EqDiHyper

Value Members

Inherited from AnyHyperEdge[CC.NodeT]

Value Members

Inherited from Eq

Value Members

Inherited from Edge[CC.NodeT]

Value Members

Inherited from AnyRef

Value Members

Inherited from Any

Value Members

Inherited by implicit conversion toOuterEdge fromCC.InnerDiHyperEdge to E

Value Members

Inherited by implicit conversion any2stringadd fromCC.InnerDiHyperEdge to any2stringadd[CC.InnerDiHyperEdge]

Value Members

Inherited by implicit conversion StringFormat fromCC.InnerDiHyperEdge to StringFormat[CC.InnerDiHyperEdge]

Value Members

Inherited by implicit conversion Ensuring fromCC.InnerDiHyperEdge to Ensuring[CC.InnerDiHyperEdge]

Value Members

Inherited by implicit conversion ArrowAssoc fromCC.InnerDiHyperEdge to ArrowAssoc[CC.InnerDiHyperEdge]

Value Members

Ungrouped

InnerDiHyperEdge