Graph Core
2.0.2
API
Generated with
Graph Core/scalax.collection/scalax.collection.generator/GraphGen

GraphGen

scalax.collection.generator.GraphGen$
See theGraphGen companion class
object GraphGen

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

Attributes

Companion
class
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
GraphGen.type

Members list

Type members

Classlikes

trait Metrics[N] extends MetricsBase[N]

Represents graph metrics like order, nodeDegrees and connected excluding the type of nodes, edges and the type of the graph to be generated.

Represents graph metrics like order, nodeDegrees and connected excluding the type of nodes, edges and the type of the graph to be generated.

Attributes

Supertypes
trait MetricsBase[N]
class Object
trait Matchable
class Any
Known subtypes
object SmallInt.type
object TinyInt.type
object SmallInt extends Metrics[Int]

Predefined metrics of a 'small' graph with the node type of Int, an order of 20 and a node degree range of 2 to 5 including org.scalacheck.Gen[Int].

Predefined metrics of a 'small' graph with the node type of Int, an order of 20 and a node degree range of 2 to 5 including org.scalacheck.Gen[Int].

Attributes

Supertypes
trait Metrics[Int]
trait MetricsBase[Int]
class Object
trait Matchable
class Any
Self type
SmallInt.type
object TinyInt extends Metrics[Int]

Predefined metrics of a 'tiny' graph with the node type of Int, an order of 5 and a node degree range of 2 to 4 including org.scalacheck.Gen[Int].

Predefined metrics of a 'tiny' graph with the node type of Int, an order of 5 and a node degree range of 2 to 4 including org.scalacheck.Gen[Int].

Attributes

Supertypes
trait Metrics[Int]
trait MetricsBase[Int]
class Object
trait Matchable
class Any
Self type
TinyInt.type

Value members

Concrete methods

def apply[N, E <: Edge[N], G <: ([X, Y <: Edge[X]] =>> AnyGraph[X, Y] & GraphLike[X, Y, LazyRef(...)])](graphCompanion: GenericGraphFactory[G], order: Int, nodeGen: Gen[N], nodeDegrees: NodeDegreeRange, edgeCompanions: Set[EdgeCompanionBase], connected: Boolean, weightFactory: Option[Gen[Long]], labelFactory: Option[Gen[Any]])(implicit nodeTag: ClassTag[N]): GraphGen[N, E, G]
def diGraph[N, G <: ([X, Y <: Edge[X]] =>> AnyGraph[X, Y] & GraphLike[X, Y, LazyRef(...)])](graphCompanion: GenericGraphFactory[G], metrics: Metrics[N])(implicit nodeTag: ClassTag[N]): Arbitrary[G[N, DiEdge[N]]]

Returns an org.scalacheck.Arbitrary[G[N,DiEdge]] for non-labeled directed graphs of any metrics and any type.

Returns an org.scalacheck.Arbitrary[G[N,DiEdge]] for non-labeled directed graphs of any metrics and any type.

Value parameters

graphCompanion

The graph companion object such as scalax.collection.Graph to be used to generate graphs.

metrics

The Metrics to be applied to the generated graph.

Attributes

def fromMetrics[N, E <: Edge[N], G <: ([X, Y <: Edge[X]] =>> AnyGraph[X, Y] & GraphLike[X, Y, LazyRef(...)])](graphCompanion: GenericGraphFactory[G], metrics: Metrics[N], edgeCompanions: Set[EdgeCompanionBase])(implicit nodeTag: ClassTag[N]): GraphGen[N, E, G]
def smallConnectedIntDi[G <: ([X, Y <: Edge[X]] =>> AnyGraph[X, Y] & GraphLike[X, Y, LazyRef(...)])](graphCompanion: GenericGraphFactory[G]): Arbitrary[G[Int, DiEdge[Int]]]

Returns an org.scalacheck.Arbitrary[G[Int,DiEdge]] for small, connected, non-labeled directed graphs with the metrics defined by SmallInt.

Returns an org.scalacheck.Arbitrary[G[Int,DiEdge]] for small, connected, non-labeled directed graphs with the metrics defined by SmallInt.

Value parameters

graphCompanion

The graph companion object such as scalax.collection.Graph to be used to generate graphs.

Attributes

def tinyConnectedIntDi[G <: ([X, Y <: Edge[X]] =>> AnyGraph[X, Y] & GraphLike[X, Y, LazyRef(...)])](graphCompanion: GenericGraphFactory[G]): Arbitrary[G[Int, DiEdge[Int]]]

Returns an org.scalacheck.Arbitrary[G[Int,DiEdge]] for tiny, connected, non-labeled directed graphs with the metrics defined by TinyInt.

Returns an org.scalacheck.Arbitrary[G[Int,DiEdge]] for tiny, connected, non-labeled directed graphs with the metrics defined by TinyInt.

Value parameters

graphCompanion

The graph companion object such as scalax.collection.Graph to be used to generate graphs.

Attributes

def unDiGraph[N, G <: ([X, Y <: Edge[X]] =>> AnyGraph[X, Y] & GraphLike[X, Y, LazyRef(...)])](graphCompanion: GenericGraphFactory[G], metrics: Metrics[N])(implicit nodeTag: ClassTag[N]): Arbitrary[G[N, UnDiEdge[N]]]

Returns an org.scalacheck.Arbitrary[G[N,UnDiEdge]] for non-labeled undirected graphs of any metrics and any type.

Returns an org.scalacheck.Arbitrary[G[N,UnDiEdge]] for non-labeled undirected graphs of any metrics and any type.

Value parameters

graphCompanion

The graph companion object such as scalax.collection.Graph to be used to generate graphs.

metrics

The Metrics to be applied to the generated graph.

Attributes

Generated with