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 immutable

Definition Classes
collection
trait AdjacencyListBase[N, E[X] <: EdgeLikeIn[X], +This[X, Y[X] <: EdgeLikeIn[X]] <: GraphLike[X, Y[X], This] with Set[Param[X, Y[X]]] with collection.Graph[X, Y[X]]] extends GraphLike[N, E, This]
Implementation of an incident list based graph representation.
Implementation of an incident list based graph representation. This trait is common to both the immutable and mutable variants. An incidence list based representation speeds up traversing the graph along its paths by storing the list of connecting edges at each node.

Definition Classes
immutable
trait InnerNode extends (AdjacencyListBase.this)#InnerNode

Definition Classes
AdjacencyListBase
Adj

scalax.collection.immutable.AdjacencyListBase.InnerNode

Adj

object Adj extends Serializable

Attributes: protected[scalax.collection]

Linear Supertypes

Serializable, Serializable, AnyRef, Any

Ordering

Alphabetic
By Inheritance

Inherited

Adj
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
var _aHook: Option[((AdjacencyListBase.this)#NodeT, (AdjacencyListBase.this)#EdgeT)]

Attributes
protected[scalax.collection]
final def aHook: Option[((AdjacencyListBase.this)#NodeT, (AdjacencyListBase.this)#EdgeT)]
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@native() @throws( ... )
final def diSucc: EqHashMap[(AdjacencyListBase.this)#NodeT, (AdjacencyListBase.this)#EdgeT]
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( ... )

Packages

Adj

object Adj extends Serializable

Value Members

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped

Packages

Adj 

object Adj extends Serializable

Value Members

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped

Adj