object RandomGraph
Provides convenience metrics and methods for the generation of random graphs.
- Alphabetic
- By Inheritance
- RandomGraph
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Type Members
- trait IntFactory extends Metrics[Int]
- trait Metrics[N] extends MetricsBase[N]
- trait MetricsBase[N] extends AnyRef
Template for
Metricswithconnectedset totrueand some lazy values useful for checking the metrics of generated graphs.
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def apply[N, E[+X] <: EdgeLikeIn[X], G[X, Y[+Z] <: EdgeLikeIn[Z]] <: Graph[X, Y[Z]] with GraphLike[X, Y[Z], G]](graphCompanion: GraphCompanion[G], metrics: Metrics[N], edgeCompanions: Set[EdgeCompanionBase[E]])(implicit edgeTag: ClassTag[E[N]], nodeTag: ClassTag[N]): RandomGraph[N, E, G]
- def apply[N, E[+X] <: EdgeLikeIn[X], G[X, Y[+Z] <: EdgeLikeIn[Z]] <: Graph[X, Y[Z]] with GraphLike[X, Y[Z], G]](graphCompanion: GraphCompanion[G], order: Int, nodeFactory: => N, nodeDegree: NodeDegreeRange, edgeCompanions: Set[EdgeCompanionBase[E]], connected: Boolean, weightFactory: Option[() => Long], labelFactory: Option[() => Any])(implicit edgeTag: ClassTag[E[N]], nodeTag: ClassTag[N]): RandomGraph[N, E, G]
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- def diGraph[N, G[N, E[+X] <: EdgeLikeIn[X]] <: Graph[N, E[X]] with GraphLike[N, E[X], G]](graphCompanion: GraphCompanion[G], metrics: Metrics[N])(implicit edgeTag: ClassTag[DiEdge[N]], nodeTag: ClassTag[N]): RandomGraph[N, DiEdge, 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.
- graphCompanion
The graph companion object such as
scalax.collection.Graphto be used to generate graphs.- metrics
The
Metricsto be applied to the generated graph.
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def smallConnectedIntDi[G[N, E[+X] <: EdgeLikeIn[X]] <: Graph[N, E[X]] with GraphLike[N, E[X], G]](graphCompanion: GraphCompanion[G]): RandomGraph[Int, DiEdge, 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.- graphCompanion
The graph companion object such as
scalax.collection.Graphto be used to generate graphs.
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tinyConnectedIntDi[G[N, E[+X] <: EdgeLikeIn[X]] <: Graph[N, E[X]] with GraphLike[N, E[X], G]](graphCompanion: GraphCompanion[G]): RandomGraph[Int, DiEdge, 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.- graphCompanion
The graph companion object such as
scalax.collection.Graphto be used to generate graphs.
- def toString(): String
- Definition Classes
- AnyRef → Any
- def unDiGraph[N, G[N, E[+X] <: EdgeLikeIn[X]] <: Graph[N, E[X]] with GraphLike[N, E[X], G]](graphCompanion: GraphCompanion[G], metrics: Metrics[N])(implicit edgeTag: ClassTag[UnDiEdge[N]], nodeTag: ClassTag[N]): RandomGraph[N, UnDiEdge, 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.
- graphCompanion
The graph companion object such as
scalax.collection.Graphto be used to generate graphs.- metrics
The
Metricsto be applied to the generated graph.
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- object SmallInt extends IntFactory
Predefined metrics of a 'small' graph with the node type of
Int, an order of20and a node degree range of2to5. - object TinyInt extends IntFactory
Predefined metrics of a 'tiny' graph with the node type of
Int, an order of5and a node degree range of2to4.
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graphmutable.Graphand its inner nodes.GraphEdgeobjectedgepackageGraphPredefobject andImplicitsobject.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.