abstract class AbstractUnDiEdge[+N] extends AnyUnDiEdge[N]
- Alphabetic
- By Inheritance
- AbstractUnDiEdge
- AnyUnDiEdge
- EqUnDi
- AnyEdge
- AnyHyperEdge
- EqHyper
- Eq
- Edge
- Equals
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new AbstractUnDiEdge(source: N, target: N)
Value Members
- final def _1: N
The first node of this edge.
The first node of this edge.
- Definition Classes
- AnyUnDiEdge → AnyHyperEdge → Edge
- Annotations
- @inline()
- final def _2: N
The second node of this edge.
The second node of this edge.
- Definition Classes
- AnyUnDiEdge → AnyHyperEdge → Edge
- Annotations
- @inline()
- final def arity: Int
Number of the endpoints of this edge.
- def canEqual(that: Any): Boolean
- Definition Classes
- Edge → Equals
- final def contains[M >: N](node: M): Boolean
Same as
isAt.Same as
isAt.- Definition Classes
- Edge
- Annotations
- @inline()
- def ends: Several[N]
The endpoints of this edge, in other words the nodes this edge connects.
- def equals(other: Any): Boolean
- Definition Classes
- Eq → AnyRef → Any
- final def hasSource(pred: (N) => Boolean): Boolean
trueif any source end of this edge fulfillspred.trueif any source end of this edge fulfillspred.- Definition Classes
- AnyUnDiEdge → AnyHyperEdge → Edge
- final def hasSource[M >: N](node: M): Boolean
trueifnodeis a source of this edge.trueifnodeis a source of this edge. In case this edge is undirected this method maps toisAt.- Definition Classes
- AnyUnDiEdge → AnyHyperEdge → Edge
- final def hasTarget(pred: (N) => Boolean): Boolean
trueif any target end of this edge fulfillspred.trueif any target end of this edge fulfillspred.- Definition Classes
- AnyUnDiEdge → AnyHyperEdge → Edge
- final def hasTarget[M >: N](node: M): Boolean
trueifnodeis a target of this edge.trueifnodeis a target of this edge. In case this edge is undirected this method maps toisAt.- Definition Classes
- AnyUnDiEdge → AnyHyperEdge → Edge
- def hashCode(): Int
- Definition Classes
- Eq → AnyRef → Any
- final def isAt(pred: (N) => Boolean): Boolean
trueif any end of this edge fulfillspred. - final def isAt[M >: N](node: M): Boolean
trueifnodeis incident with this edge. - def isDirected: Boolean
Whether this edge is directed.
Whether this edge is directed.
- Definition Classes
- AnyUnDiEdge → AnyHyperEdge → Edge
- final def isHyperEdge: Boolean
Whether this edge's type is hyperedge meaning that it may have more than two ends.
- def isLabeled: Boolean
- Definition Classes
- Edge
- final 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
- AnyUnDiEdge → AnyEdge → AnyHyperEdge → Edge
- final def isUndirected: Boolean
Whether this edge is undirected.
Whether this edge is undirected.
- Definition Classes
- Edge
- Annotations
- @inline()
- def matches(p1: (N) => Boolean, p2: (N) => Boolean): Boolean
trueif
a) two distinct ends of this undirected edge exist for whichp1andp2hold or
b)p1holds for a source andp2for a target of this directed edge.trueif
a) two distinct ends of this undirected edge exist for whichp1andp2hold or
b)p1holds for a source andp2for a target of this directed edge.- Definition Classes
- AnyUnDiEdge → AnyHyperEdge → Edge
- def matches[M >: N](n1: M, n2: M): Boolean
trueiftrueif- being an undirected edge, both
n1andn2are at this edge - being a directed edge,
n1is a source andn2a target of this edge.
- Definition Classes
- AnyUnDiEdge → AnyHyperEdge → Edge
- being an undirected edge, both
- final def node(n: Int): N
The n'th node of this 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()
- val source: N
- Definition Classes
- AbstractUnDiEdge → AnyUnDiEdge
- final def sources: OneOrMore[N]
All source ends of this edge.
All source ends of this edge.
- Definition Classes
- AnyUnDiEdge → AnyHyperEdge → Edge
- Annotations
- @inline()
- val target: N
- Definition Classes
- AbstractUnDiEdge → AnyUnDiEdge
- final def targets: OneOrMore[N]
All target ends of this edge.
All target ends of this edge.
- Definition Classes
- AnyUnDiEdge → AnyHyperEdge → Edge
- Annotations
- @inline()
- 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
weightis 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 inExtendedKeyand addsweighttokeyAttributes.- Definition Classes
- Edge
- final def withSources[U](f: (N) => U): Unit
Applies
fto all source ends of this edge without any memory allocation.Applies
fto all source ends of this edge without any memory allocation.- Definition Classes
- AnyUnDiEdge → AnyHyperEdge → Edge
- final def withTargets[U](f: (N) => U): Unit
Applies
fto the target ends of this edge without any memory allocation.Applies
fto the target ends of this edge without any memory allocation.- Definition Classes
- AnyUnDiEdge → AnyHyperEdge → Edge
Welcome to the Graph for Scala API reference. Some suggested entry points:
AnyGraphimmutable.Graphand its inner nodesmutable.Graphand its inner nodes.edgespackage and its subpackageshyperedgespackage and its subpackages.labeled edgespackagemultilabeled edgespackagelabeled hyperedgespackagemultilabeled hyperedgespackageordered labeled hyperedgespackageordered multilabeled hyperedgesobjectgenericpackage.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.