GraphGen

scalax.collection.generator.GraphGen
See theGraphGen companion object
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.

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
Graph
Supertypes
class Object
trait Matchable
class Any

Members list

Value members

Concrete methods

def apply: Gen[G[N, E]]

Concrete fields

val order: Int