scalax.collection.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.

Attributes

Members list

Type members

Classlikes

class GraphGen[N, E <: Edge[N], G <: ([X, Y <: Edge[X]] =>> AnyGraph[X, Y] & GraphLike[X, Y, G])](val graphCompanion: GenericGraphFactory[G], val order: Int, nodeGen: Gen[N], nodeDegrees: NodeDegreeRange, edgeCompanions: Set[EdgeCompanionBase], connected: Boolean, weightFactory: Option[Gen[Long]], labelFactory: Option[Gen[Any]])(implicit nodeTag: ClassTag[N])

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

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

Type parameters

E

Kind of type of the edges the generated will contain.

G

Kind of type of the graph to be generated.

N

Type of the nodes the generated will contain.

Value parameters

connected

Whether the generated graph should be connected.

edgeCompanions

The edge types to be used in the generated graph.

graphCompanion

The graph companion the factory method fromof which is to be called to create random graphs.

nodeDegrees

The characteristics of node degrees such as the span of degrees for the graph to be generated.

nodeGen

A node generator that is assumed to generate enough unique elements with respect to order. Typically it will be enough to define a range of elements ten fold of order.

order

The total number of nodes the generated random graphs should contain.

Attributes

Companion
object
Supertypes
class Object
trait Matchable
class Any
object GraphGen

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

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

Attributes

Companion
class
Supertypes
class Object
trait Matchable
class Any
Self type
GraphGen.type
class RandomGraph[N, E <: Edge[N], G <: ([X, Y <: Edge[X]] =>> AnyGraph[X, Y] & GraphLike[X, Y, G])](val graphCompanion: GenericGraphFactory[G], val order: Int, nodeFactory: => N, nodeDegree: NodeDegreeRange, edgeCompanions: Set[EdgeCompanionBase], connected: Boolean, weightFactory: Option[() => Long], labelFactory: Option[() => Any])(implicit nodeTag: ClassTag[N])

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

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

Type parameters

E

Kind of type of the edges the generated will contain.

G

Kind of type of the graph to be generated.

N

Type of the nodes the generated will contain.

Value parameters

connected

Whether the generated graph should be connected.

edgeCompanions

The edge types to be used in the generated graph.

graphCompanion

The graph companion the factory method fromof which is to be called to create random graphs.

nodeDegree

The characteristics of node degrees such as the span of degrees for the graph to be generated.

nodeFactory

The function responsible for generating nodes.

order

The total number of nodes the generated random graph should contain.

Attributes

Companion
object
Supertypes
class Object
trait Matchable
class Any
object RandomGraph

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

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

Attributes

Companion
class
Supertypes
class Object
trait Matchable
class Any
Self type

Value members

Concrete fields

val NodeDegreeRange: NodeDegreeRange.type