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

RandomGraph

scalax.collection.generator.RandomGraph$
See theRandomGraph companion class
object RandomGraph

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

Attributes

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

Members list

Type members

Classlikes

trait IntFactory extends Metrics[Int]

Attributes

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

Attributes

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

Template for Metrics with connected set to true and some lazy values useful for checking the metrics of generated graphs.

Template for Metrics with connected set to true and some lazy values useful for checking the metrics of generated graphs.

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
trait Metrics[N]
object SmallInt.type
object TinyInt.type
trait Metrics[N]
trait IntFactory
object SmallInt.type
object TinyInt.type
Show all
object SmallInt extends IntFactory

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.

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.

Attributes

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

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.

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.

Attributes

Supertypes
trait IntFactory
trait Metrics[Int]
trait MetricsBase[Int]
class Object
trait Matchable
class Any
Show all
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, nodeFactory: => N, nodeDegree: NodeDegreeRange, edgeCompanions: Set[EdgeCompanionBase], connected: Boolean, weightFactory: Option[() => Long], labelFactory: Option[() => Any])(implicit nodeTag: ClassTag[N]): RandomGraph[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]): RandomGraph[N, DiEdge[N], G]

Returns a generator for non-labeled directed graphs of any metrics and any type.

Returns a generator 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]): RandomGraph[N, E, G]
def smallConnectedIntDi[N, G <: ([X, Y <: Edge[X]] =>> AnyGraph[X, Y] & GraphLike[X, Y, LazyRef(...)])](graphCompanion: GenericGraphFactory[G]): RandomGraph[Int, DiEdge[Int], G]

Returns a generator for small, connected, non-labeled directed graphs with the metrics defined by SmallInt.

Returns a generator 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]): RandomGraph[Int, DiEdge[Int], G]

Returns a generator for tiny, connected, non-labeled directed graphs with the metrics defined by TinyInt.

Returns a generator 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]): RandomGraph[N, UnDiEdge[N], G]

Returns a generator for non-labeled undirected graphs of any metrics and any type.

Returns a generator 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