Graph Core1.12.3 < 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 config

Definition Classes
collection
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
package generator
This package helps you to create random graphs with predefined metrics.
This package helps you to create random graphs with predefined metrics. It is not only possible to create random graph instances but also Scalacheck generators.

Definition Classes
collection
package generic

Definition Classes
collection
package immutable

Definition Classes
collection
package interfaces

Definition Classes
collection
package mutable

Definition Classes
collection
EdgeUsage
Graph
GraphBase
GraphDegree
GraphEdge
GraphLike
GraphPredef
GraphTraversal
GraphTraversalImpl
State
TraverserImpl

scalax.collection

GraphTraversalImpl

Companion trait GraphTraversalImpl

object GraphTraversalImpl extends Serializable

Linear Supertypes

Serializable, Serializable, AnyRef, Any

Ordering

Alphabetic
By Inheritance

Inherited

GraphTraversalImpl
Serializable
Serializable
AnyRef
Any

Hide All
Show All

Visibility

Public
All

Type Members

trait BfsInformer[N] extends NodeInformer
Extended node visitor informer for breath first searches.
type Depth = Int
trait DfsInformer[N] extends NodeInformer
Extended node visitor informer for depth first searches.
abstract class DijkstraInformer[N, T] extends NodeInformer
Extended node visitor informer for calculating shortest paths.
Extended node visitor informer for calculating shortest paths. This informer always returns 0 for depth.
abstract class TarjanInformer[N] extends NodeInformer
Extended node visitor informer for Tarjan's algorithm.
trait WgbInformer[N, E] extends NodeInformer
Extended node visitor informer for cycle detecting.
Extended node visitor informer for cycle detecting. This informer always returns 0 for depth.

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 BfsInformer
object DfsInformer
object DijkstraInformer
object TarjanInformer
object WgbInformer

Packages

GraphTraversalImpl

Companion trait GraphTraversalImpl

object GraphTraversalImpl extends Serializable

Type Members

Value Members

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped

Packages

GraphTraversalImpl 

Companion trait GraphTraversalImpl

object GraphTraversalImpl extends Serializable

Type Members

Value Members

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped

GraphTraversalImpl