class GraphGen[N, E[+X] <: EdgeLikeIn[X], 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.
- 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.
- Alphabetic
- By Inheritance
- GraphGen
- AnyRef
- Any
- by ChainingOps
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new GraphGen(graphCompanion: GraphCompanion[G], order: Int, nodeGen: Gen[N], nodeDegrees: NodeDegreeRange, edgeCompanions: Set[EdgeCompanionBase[E]], connected: Boolean = true, weightFactory: Option[Gen[Long]] = None, labelFactory: Option[Gen[Any]] = None)(implicit edgeTag: ClassTag[E[N]], nodeTag: ClassTag[N])
- graphCompanion
The graph companion the factory method
fromof which is to be called to create random graphs.- order
The total number of nodes the generated random graphs should contain.
- nodeGen
A node generator that is assumed to generate enough unique elements with respect to
order. Typically it will be enough to define a range of elements ten fold oforder.- nodeDegrees
The characteristics of node degrees such as the span of degrees for the graph to be generated.
- edgeCompanions
The edge types to be used in the generated graph.
- connected
Whether the generated graph should be connected.
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- def ->[B](y: B): (GraphGen[N, E, G], B)
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def apply: Gen[G[N, E]]
- 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 ensuring(cond: (GraphGen[N, E, G]) => Boolean, msg: => Any): GraphGen[N, E, G]
- def ensuring(cond: (GraphGen[N, E, G]) => Boolean): GraphGen[N, E, G]
- def ensuring(cond: Boolean, msg: => Any): GraphGen[N, E, G]
- def ensuring(cond: Boolean): GraphGen[N, E, G]
- 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()
- val graphCompanion: GraphCompanion[G]
- 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
- def nodeSetGen: Gen[Set[N]]
- Attributes
- protected[collection.generator]
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- val order: Int
- val outerNodeSet: Arbitrary[Set[N]]
- Attributes
- protected[collection.generator]
- def pipe[B](f: (GraphGen[N, E, G]) => B): B
- Implicit
- This member is added by an implicit conversion from GraphGen[N, E, G] toChainingOps[GraphGen[N, E, G]] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- val self: GraphGen[N, E, G]
- Implicit
- This member is added by an implicit conversion from GraphGen[N, E, G] toChainingOps[GraphGen[N, E, G]] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tap[U](f: (GraphGen[N, E, G]) => U): GraphGen[N, E, G]
- Implicit
- This member is added by an implicit conversion from GraphGen[N, E, G] toChainingOps[GraphGen[N, E, G]] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- def toString(): String
- Definition Classes
- AnyRef → Any
- 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])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
- def formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from GraphGen[N, E, G] toStringFormat[GraphGen[N, E, G]] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.12.16) Use
formatString.format(value)instead ofvalue.formatted(formatString), or use thef""string interpolator. In Java 15 and later,formattedresolves to the new method in String which has reversed parameters.
- def →[B](y: B): (GraphGen[N, E, G], B)
- Implicit
- This member is added by an implicit conversion from GraphGen[N, E, G] toArrowAssoc[GraphGen[N, E, G]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use
->instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graphmutable.Graphand its inner nodes.GraphEdgeobjectedgepackageGraphPredefobject andImplicitsobject.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.