object LBase
Base traits for labeled edges.
- Alphabetic
- By Inheritance
- LBase
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Type Members
- trait LEdge[+N] extends AnyRef
- type LEdgeBound[+N] = LHyperEdgeBound[N] with UnDiEdge[N]
- trait LEdgeCompanion[E[+X] <: LEdgeBound[X]] extends EdgeCompanionBase[E]
Everything common to predefined edge labeled edge companion objects.
- abstract class LEdgeImplicits[UL] extends OuterLEdgeImplicits[UL]
Implicit conversions from an inner or outer labeled edge to its label.
Implicit conversions from an inner or outer labeled edge to its label. In case of inner edges, this trait works for scalax.collection.Graph only. For other graph types see scalax.collection.edge.LBase.TypedLEdgeImplicits.
- UL
type of the user label.
- type LHyperEdgeBound[+N] = EdgeLikeIn[N] with HyperEdge[N] with LEdge[N] with Serializable
- trait LHyperEdgeCompanion[E[+X] <: LHyperEdgeBound[X]] extends EdgeCompanionBase[E]
Everything common to labeled hyperedge companion objects.
- abstract class OuterLEdgeImplicits[UL] extends AnyRef
Implicit conversions from an outer labeled edge to its label.
Implicit conversions from an outer labeled edge to its label.
- UL
type of the user label.
- abstract class TypedLEdgeImplicits[G[N, E[+X] <: EdgeLikeIn[X]] <: GraphBase[N, E[X]], UL] extends OuterLEdgeImplicits[UL]
Implicit conversions from an inner or outer labeled edge to its label for any graph type.
Implicit conversions from an inner or outer labeled edge to its label for any graph type.
- G
kind of type of graph.
- UL
type of the user label.
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 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 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
- 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])
- object LEdge
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graphmutable.Graphand its inner nodes.GraphEdgeobjectedgepackageGraphPredefobject andImplicitsobject.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.