object LBase
Base traits for labeled edges.
- Alphabetic
- By Inheritance
- LBase
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
- trait LEdge[+N] extends AnyRef
- type LEdgeBound[N, +E[X <: N] <: EdgeLikeIn[X]] = LHyperEdgeBound[N, E] with UnDiEdge[N]
-
trait
LEdgeCompanion[E[X] <: EdgeLikeIn[X] with LEdgeBound[_, E]] 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, +E[X <: N] <: EdgeLikeIn[X]] = HyperEdge[N] with LEdge[N] with Serializable
-
trait
LHyperEdgeCompanion[E[X] <: EdgeLikeIn[X] with LHyperEdgeBound[_, E]] 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[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
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
-
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
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( ... )
- object LEdge
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graph
mutable.Graph
and its inner nodes.GraphEdge
objectedge
packageGraphPredef
object andImplicits
object.GraphTraversal
andTraverserInnerNode
.RandomGraph
.GraphGen
.