trait GraphInnerEdge extends CC.BaseInnerEdge
- Self Type
- CC.EdgeT
- Alphabetic
- By Inheritance
- GraphInnerEdge
- BaseInnerEdge
- InnerEdge
- InnerElem
- InnerEdgeLike
- Edge
- Equals
- AnyRef
- Any
- by toOuterEdge
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Abstract Value Members
- abstract def _1: CC.NodeT
The first node of this edge.
The first node of this edge.
- Definition Classes
- Edge
- abstract def _2: CC.NodeT
The second node of this edge.
The second node of this edge.
- Definition Classes
- Edge
- abstract 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
- Edge
- abstract 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
- Edge
- abstract def hasSource(pred: (CC.NodeT) => Boolean): Boolean
trueif any source end of this edge fulfillspred.trueif any source end of this edge fulfillspred.- Definition Classes
- Edge
- abstract def hasSource[M >: CC.NodeT](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
- Edge
- abstract def hasTarget(pred: (CC.NodeT) => Boolean): Boolean
trueif any target end of this edge fulfillspred.trueif any target end of this edge fulfillspred.- Definition Classes
- Edge
- abstract def hasTarget[M >: CC.NodeT](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
- Edge
- abstract def isAt(pred: (CC.NodeT) => Boolean): Boolean
trueif any end of this edge fulfillspred.trueif any end of this edge fulfillspred.- Definition Classes
- Edge
- abstract def isAt[M >: CC.NodeT](node: M): Boolean
trueifnodeis incident with this edge.trueifnodeis incident with this edge.- Definition Classes
- Edge
- abstract def isDirected: Boolean
Whether this edge is directed.
Whether this edge is directed.
- Definition Classes
- Edge
- abstract 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
- Edge
- abstract 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
- Edge
- abstract def matches(p1: (CC.NodeT) => Boolean, p2: (CC.NodeT) => 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
- Edge
- abstract def matches[M >: CC.NodeT](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
- Edge
- being an undirected edge, both
- abstract def node(n: Int): CC.NodeT
The n'th node of this edge.
The n'th node of this edge.
- Definition Classes
- Edge
- Exceptions thrown
IllegalArgumentExceptionifndoes not meet0 <= n < arity.
- abstract def outer: E
The outer edge as supplied by instantiation or addition.
The outer edge as supplied by instantiation or addition.
- Definition Classes
- InnerEdge
- abstract def sources: OneOrMore[CC.NodeT]
All source ends of this edge.
All source ends of this edge.
- Definition Classes
- Edge
- abstract def targets: OneOrMore[CC.NodeT]
All target ends of this edge.
All target ends of this edge.
- Definition Classes
- Edge
- abstract def withSources[U](f: (CC.NodeT) => 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
- Edge
- abstract def withTargets[U](f: (CC.NodeT) => 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
- Edge
Concrete 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.GraphInnerEdge toany2stringadd[CC.GraphInnerEdge] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
- def ->[B](y: B): (CC.GraphInnerEdge, B)
- Implicit
- This member is added by an implicit conversion from CC.GraphInnerEdge toArrowAssoc[CC.GraphInnerEdge] 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
- final def asEdgeT: CC.EdgeT
- Attributes
- protected[collection]
- Definition Classes
- GraphInnerEdge → InnerEdge
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- 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
Graphinstance that containsthisinner edge. - 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 ensuring(cond: (CC.GraphInnerEdge) => Boolean, msg: => Any): CC.GraphInnerEdge
- Implicit
- This member is added by an implicit conversion from CC.GraphInnerEdge toEnsuring[CC.GraphInnerEdge] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: (CC.GraphInnerEdge) => Boolean): CC.GraphInnerEdge
- Implicit
- This member is added by an implicit conversion from CC.GraphInnerEdge toEnsuring[CC.GraphInnerEdge] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean, msg: => Any): CC.GraphInnerEdge
- Implicit
- This member is added by an implicit conversion from CC.GraphInnerEdge toEnsuring[CC.GraphInnerEdge] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean): CC.GraphInnerEdge
- Implicit
- This member is added by an implicit conversion from CC.GraphInnerEdge toEnsuring[CC.GraphInnerEdge] 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
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- BaseInnerEdge → AnyRef → Any
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- 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 ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- 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()
- 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
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- 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
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
- BaseInnerEdge → Edge
- Annotations
- @inline()
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.GraphInnerEdge 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:(graphInnerEdge: E).arity
- Definition Classes
- Edge
- def canEqual(that: Any): Boolean
- Implicit
- This member is added by an implicit conversion from CC.GraphInnerEdge 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:(graphInnerEdge: 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.GraphInnerEdge 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:(graphInnerEdge: 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.GraphInnerEdge 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:(graphInnerEdge: E).ends
- Definition Classes
- Edge
- def hasSource(pred: (N) => Boolean): Boolean
trueif any source end of this edge fulfillspred.trueif any source end of this edge fulfillspred.- Implicit
- This member is added by an implicit conversion from CC.GraphInnerEdge 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:(graphInnerEdge: E).hasSource(pred)
- Definition Classes
- Edge
- def hasSource[M >: CC.NodeT](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.- Implicit
- This member is added by an implicit conversion from CC.GraphInnerEdge 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:(graphInnerEdge: E).hasSource(node)
- Definition Classes
- Edge
- def hasTarget(pred: (N) => Boolean): Boolean
trueif any target end of this edge fulfillspred.trueif any target end of this edge fulfillspred.- Implicit
- This member is added by an implicit conversion from CC.GraphInnerEdge 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:(graphInnerEdge: E).hasTarget(pred)
- Definition Classes
- Edge
- def hasTarget[M >: CC.NodeT](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.- Implicit
- This member is added by an implicit conversion from CC.GraphInnerEdge 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:(graphInnerEdge: E).hasTarget(node)
- Definition Classes
- Edge
- def isAt(pred: (N) => Boolean): Boolean
trueif any end of this edge fulfillspred.trueif any end of this edge fulfillspred.- Implicit
- This member is added by an implicit conversion from CC.GraphInnerEdge 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:(graphInnerEdge: E).isAt(pred)
- Definition Classes
- Edge
- def isAt[M >: CC.NodeT](node: M): Boolean
trueifnodeis incident with this edge.trueifnodeis incident with this edge.- Implicit
- This member is added by an implicit conversion from CC.GraphInnerEdge 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:(graphInnerEdge: 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.GraphInnerEdge 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:(graphInnerEdge: 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.GraphInnerEdge 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:(graphInnerEdge: E).isHyperEdge
- Definition Classes
- Edge
- def isLabeled: Boolean
- Implicit
- This member is added by an implicit conversion from CC.GraphInnerEdge 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:(graphInnerEdge: 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.GraphInnerEdge 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:(graphInnerEdge: 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.GraphInnerEdge 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:(graphInnerEdge: E).isUndirected
- 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.- Implicit
- This member is added by an implicit conversion from CC.GraphInnerEdge 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:(graphInnerEdge: E).matches(p1, p2)
- Definition Classes
- Edge
- def matches[M >: CC.NodeT](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.
- Implicit
- This member is added by an implicit conversion from CC.GraphInnerEdge 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:(graphInnerEdge: E).matches(n1, n2)
- Definition Classes
- Edge
- being an undirected edge, both
- 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.GraphInnerEdge 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:(graphInnerEdge: E).node(n)
- Definition Classes
- Edge
- Exceptions thrown
IllegalArgumentExceptionifndoes not meet0 <= n < arity.
- 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.GraphInnerEdge 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:(graphInnerEdge: 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.GraphInnerEdge 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:(graphInnerEdge: 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.GraphInnerEdge 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:(graphInnerEdge: 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.GraphInnerEdge 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:(graphInnerEdge: 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
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.- Implicit
- This member is added by an implicit conversion from CC.GraphInnerEdge 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:(graphInnerEdge: E).weight
- Definition Classes
- Edge
- 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.- Implicit
- This member is added by an implicit conversion from CC.GraphInnerEdge 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:(graphInnerEdge: E).withSources(f)
- Definition Classes
- Edge
- 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.- Implicit
- This member is added by an implicit conversion from CC.GraphInnerEdge 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:(graphInnerEdge: 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
- def formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from CC.GraphInnerEdge toStringFormat[CC.GraphInnerEdge] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.12.16) Use
formatString.format(value)instead ofvalue.formatted(formatString), or use thef""string interpolator. In Java 15 and later,formattedresolves to the new method in String which has reversed parameters.
- def →[B](y: B): (CC.GraphInnerEdge, B)
- Implicit
- This member is added by an implicit conversion from CC.GraphInnerEdge toArrowAssoc[CC.GraphInnerEdge] 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.
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.