object WLkDiHyperEdge extends WLkHyperEdgeCompanion[WLkDiHyperEdge]
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- WLkDiHyperEdge
- WLkHyperEdgeCompanion
- WLHyperEdgeCompanion
- EdgeCompanionBase
- Serializable
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
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
-
final
def
apply[N, L](nodes: Iterable[N])(weight: Double, label: L)(implicit kind: CollectionKind): WLkDiHyperEdge[N] with EdgeCopy[WLkDiHyperEdge]
- Definition Classes
- WLHyperEdgeCompanion
- Annotations
- @inline()
-
final
def
apply[N, L](node_1: N, node_2: N, nodes: N*)(weight: Double, label: L)(implicit kind: CollectionKind = Bag): WLkDiHyperEdge[N] with EdgeCopy[WLkDiHyperEdge]
- Definition Classes
- WLHyperEdgeCompanion
- Annotations
- @inline()
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
from[N, L](nodes: Product)(weight: Double, label: L)(implicit kind: CollectionKind): WLkDiHyperEdge[N] with EdgeCopy[WLkDiHyperEdge]
- Attributes
- protected[scalax.collection]
- Definition Classes
- WLHyperEdgeCompanion
- Annotations
- @inline()
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
newEdge[N, L](nodes: Product, weight: Double, pLabel: L)(implicit endpointsKind: CollectionKind): WLkDiHyperEdge[N] with EdgeCopy[WLkDiHyperEdge]
- Attributes
- protected
- Definition Classes
- WLkDiHyperEdge → WLHyperEdgeCompanion
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
unapply[N](e: WLkDiHyperEdge[N]): Option[(Traversable[N], Double, WLkDiHyperEdge.L1)]
- Definition Classes
- WLHyperEdgeCompanion
- Annotations
- @inline()
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graphmutable.Graphand its inner nodes.GraphEdgeobjectedgepackageGraphPredefobject andImplicitsobject.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.