class
GraphGen[N, E[N] <: EdgeLikeIn[N], G[N, E[X] <: EdgeLikeIn[X]] <: Graph[N, E[X]] with GraphLike[N, E[X], G]] extends AnyRef
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: scala.reflect.api.JavaUniverse.TypeTag[E[N]], nodeTag: ClassTag[N])
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
+(other: String): String
-
def
->[B](y: B): (GraphGen[N, E, G], B)
-
final
def
==(arg0: Any): Boolean
-
def
apply: Gen[G[N, E]]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
ensuring(cond: (GraphGen[N, E, G]) ⇒ Boolean, msg: ⇒ Any): GraphGen[N, E, G]
-
-
def
ensuring(cond: Boolean, msg: ⇒ Any): GraphGen[N, E, G]
-
def
ensuring(cond: Boolean): GraphGen[N, E, G]
-
-
-
def
finalize(): Unit
-
def
formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
-
val
graphCompanion: GraphCompanion[G]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
-
def
nodeSetGen: Gen[Set[N]]
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
val
order: Int
-
val
outerNodeSet: Arbitrary[Set[N]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
→[B](y: B): (GraphGen[N, E, G], B)
Inherited by implicit conversion any2stringadd from
GraphGen[N, E, G] to any2stringadd[GraphGen[N, E, G]]
Inherited by implicit conversion StringFormat from
GraphGen[N, E, G] to StringFormat[GraphGen[N, E, G]]
Inherited by implicit conversion Ensuring from
GraphGen[N, E, G] to Ensuring[GraphGen[N, E, G]]
Inherited by implicit conversion ArrowAssoc from
GraphGen[N, E, G] to ArrowAssoc[GraphGen[N, E, G]]
A
Graph
generator in terms of org.scalacheck.Gen.Type of the nodes the generated will contain.
Kind of type of the edges the generated will contain.
Kind of type of the graph to be generated.