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
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.
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- GraphGen
- AnyRef
- Any
Implicitly
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
Visibility
- Public
- All
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.- 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[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
- 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: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- def formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- val graphCompanion: GraphCompanion[G]
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
nodeSetGen: Gen[Set[N]]
- Attributes
- protected[scalax.collection.generator]
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- val order: Int
-
val
outerNodeSet: Arbitrary[Set[N]]
- Attributes
- protected[scalax.collection.generator]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
- def →[B](y: B): (GraphGen[N, E, G], B)
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graphmutable.Graphand its inner nodes.GraphEdgeobjectedgepackageGraphPredefobject andImplicitsobject.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.