object DiHyperEdge extends DiHyperEdgeCompanion[DiHyperEdge]
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- DiHyperEdge
- DiHyperEdgeCompanion
- EdgeCompanionBase
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
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 apply[N](source_1: N, moreSources: N*)(target_1: N, moreTargets: N*): DiHyperEdge[N]- Definition Classes
- DiHyperEdgeCompanion
 
-   final  def asInstanceOf[T0]: T0- Definition Classes
- 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
 
-    def equals(arg0: AnyRef): Boolean- Definition Classes
- AnyRef → Any
 
-   final  def from[N](sources: Iterable[N], targets: Iterable[N]): Option[DiHyperEdge[N]]Somedirected hyperedge ifsourcesandtargetshave at least one element each, otherwiseNone.Somedirected hyperedge ifsourcesandtargetshave at least one element each, otherwiseNone.- Definition Classes
- DiHyperEdgeCompanion
 
-   final  def fromUnsafe[N](sources: Iterable[N], targets: Iterable[N]): DiHyperEdge[N]A directed hyperedge with the supplied sourcesandtargets.A directed hyperedge with the supplied sourcesandtargets.- Definition Classes
- DiHyperEdgeCompanion
- Exceptions thrown
- IllegalArgumentExceptionif- sourcesor- targetsis empty.
 
-   final  def getClass(): Class[_ <: AnyRef]- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
 
-    def hashCode(): Int- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
 
-   final  def isInstanceOf[T0]: Boolean- Definition Classes
- Any
 
-   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
 
-    def toString(): String- Definition Classes
- AnyRef → Any
 
-    def unapply[N](edge: DiHyperEdge[N]): Some[(OneOrMore[N], OneOrMore[N])]- Definition Classes
- DiHyperEdgeCompanion
 
-   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])
 
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.