Package

scalax.collection

generator

Permalink

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

Ordering

Alphabetic
By inheritance

Inherited

generator
AnyRef
Any

Hide All
Show all

Visibility

Public
All

Type Members

class GraphGen[N, E[N] <: EdgeLikeIn[N], 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.
type NodeDegreeRange = generator.parameters.NodeDegreeRange
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

object GraphGen

Provides convenience metrics and methods for the generation of graphs by means of org.scalacheck.Arbitrary[G[N,E]].
val NodeDegreeRange: generator.parameters.NodeDegreeRange.type
object RandomGraph

Provides convenience metrics and methods for the generation of random graphs.
package parameters
implicit def toEdgeCompanionSet[E[X] <: EdgeLikeIn[X], C <: EdgeCompanionBase[E]](set: Set[C]): Set[EdgeCompanionBase[E]]

Inherited from AnyRef

Inherited from Any

Ungrouped