scalax.collection.generator.RandomGraph
See theRandomGraph companion object
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.
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
- Graph
-
- Supertypes
-
class Objecttrait Matchableclass Any
Members list
In this article