Packages

  • package root

    Welcome to the Graph for Scala API reference.

    Welcome to the Graph for Scala API reference. Some suggested navigation entry points:

    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 parameters
  • GraphGen
  • RandomGraph
  • package generic
    Definition Classes
    collection
  • package immutable
    Definition Classes
    collection
  • package mutable
    Definition Classes
    collection

package generator

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.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. generator
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Package Members

  1. package parameters

Type Members

  1. class GraphGen[N, E[+X] <: EdgeLikeIn[X], G[N, E[+X] <: EdgeLikeIn[X]] <: Graph[N, E[X]] with GraphLike[N, E[X], G]] extends AnyRef

    A Graph generator in terms of org.scalacheck.Gen.

    A Graph generator in terms of org.scalacheck.Gen.

    N

    Type of the nodes the generated will contain.

    E

    Kind of type of the edges the generated will contain.

    G

    Kind of type of the graph to be generated.

  2. type NodeDegreeRange = generator.parameters.NodeDegreeRange
  3. abstract class RandomGraph[N, E[+X] <: EdgeLikeIn[X], G[X, Y[+Z] <: EdgeLikeIn[Z]] <: Graph[X, Y[Z]] with GraphLike[X, Y[Z], G]] extends AnyRef

    Supports random graph creation for graphs of any type with variable metrics.

    Supports random graph creation for graphs of any type with variable metrics.

    N

    Type of the nodes the generated will contain.

    E

    Kind of type of the edges the generated will contain.

    G

    Kind of type of the graph to be generated.

Value Members

  1. val NodeDegreeRange: generator.parameters.NodeDegreeRange.type
  2. implicit def toEdgeCompanionSet[E[+X] <: EdgeLikeIn[X], C <: EdgeCompanionBase[E]](set: Set[C]): Set[EdgeCompanionBase[E]]
  3. object GraphGen

    Provides convenience metrics and methods for the generation of graphs by means of org.scalacheck.Arbitrary[G[N,E]].

  4. object RandomGraph

    Provides convenience metrics and methods for the generation of random graphs.

Inherited from AnyRef

Inherited from Any

Ungrouped