Graph Core1.12.5 < Back

Packages

package root
Welcome to the Graph for Scala API reference.
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
- graph editing:
  - operators of Graph
  - or the operators of mutable.Graph and its inner nodes.
- predefined edges:
  - classes in the GraphEdge object
  - classes in the edge package
  - implicit members of the GraphPredef object and
  - operators in the accompanying Implicits object.
- graph traversal:
  - methods of GraphTraversal and TraverserInnerNode.
- random graphs RandomGraph.
- Scalacheck graph generators GraphGen.
Definition Classes
root
package scalax

Definition Classes
root
package collection
Contains the base traits and objects needed to use Graph for Scala.
Contains the base traits and objects needed to use Graph for Scala.
See also the Graph for Scala Core User Guide.

Definition Classes
scalax
package edge
Predefined edges.
Predefined edges.
While basic edge types are defined in the object GraphEdge, the predefined edges in this package cover the following categories (prefixes, shortcuts):
weighted (W, %), key-weighted (Wk, %#), labeled (L, +), key-labeled (Lk, +#), weighted and labeled (WL, %+), key-weighted and labeled (WkL, %#+), weighted and key-labeled (WLk, %+#) and key-weighted and key-labeled (WkLk, %#+#).
These predefined edges provide alternatives for any edge extension taking the burden from the user to implement his/her custom edge class - but baring the disadvantage that user edge attributes must be part of a label class as opposed to being part of the edge class directly. It may also serve as a source for looking up how to implement custom edge classes.

Definition Classes
collection
CBase
Implicits
LBase
LDiEdge
LDiHyperEdge
LHyperEdge
LUnDiEdge
LkBase
LkDiEdge
LkDiHyperEdge
LkHyperEdge
LkUnDiEdge
WBase
WDiEdge
WDiHyperEdge
WHyperEdge
WLBase
WLDiEdge
WLDiHyperEdge
WLHyperEdge
WLUnDiEdge
WLkBase
WLkDiEdge
WLkDiHyperEdge
WLkHyperEdge
WLkUnDiEdge
WUnDiEdge
WkBase
WkDiEdge
WkDiHyperEdge
WkHyperEdge
WkLBase
WkLDiEdge
WkLDiHyperEdge
WkLHyperEdge
WkLUnDiEdge
WkLkBase
WkLkDiEdge
WkLkDiHyperEdge
WkLkHyperEdge
WkLkUnDiEdge
WkUnDiEdge

scalax.collection.edge

LBase

object LBase

Base traits for labeled edges.

Linear Supertypes

AnyRef, Any

Ordering

Alphabetic
By Inheritance

Inherited

LBase
AnyRef
Any

Hide All
Show All

Visibility

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

Packages

LBase

object LBase

Type Members

Value Members

Inherited from AnyRef

Inherited from Any

Ungrouped

Packages

LBase 

object LBase

Type Members

Value Members

Inherited from AnyRef

Inherited from Any

Ungrouped

LBase