Packages

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.

Linear Supertypes
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GraphGen
  2. AnyRef
  3. Any
Implicitly
  1. by ChainingOps
  2. by any2stringadd
  3. by StringFormat
  4. by Ensuring
  5. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. 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 of order.

    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

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from GraphGen[N, E, G] toany2stringadd[GraphGen[N, E, G]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. 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
    @inline()
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. def apply: Gen[G[N, E]]
  7. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  8. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  9. def ensuring(cond: (GraphGen[N, E, G]) => Boolean, msg: => Any): GraphGen[N, E, G]
    Implicit
    This member is added by an implicit conversion from GraphGen[N, E, G] toEnsuring[GraphGen[N, E, G]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  10. def ensuring(cond: (GraphGen[N, E, G]) => Boolean): GraphGen[N, E, G]
    Implicit
    This member is added by an implicit conversion from GraphGen[N, E, G] toEnsuring[GraphGen[N, E, G]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  11. def ensuring(cond: Boolean, msg: => Any): GraphGen[N, E, G]
    Implicit
    This member is added by an implicit conversion from GraphGen[N, E, G] toEnsuring[GraphGen[N, E, G]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  12. def ensuring(cond: Boolean): GraphGen[N, E, G]
    Implicit
    This member is added by an implicit conversion from GraphGen[N, E, G] toEnsuring[GraphGen[N, E, G]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  13. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  15. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  16. val graphCompanion: GraphCompanion[G]
  17. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  18. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  19. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  20. def nodeSetGen: Gen[Set[N]]
    Attributes
    protected[collection.generator]
  21. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  22. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  23. val order: Int
  24. val outerNodeSet: Arbitrary[Set[N]]
    Attributes
    protected[collection.generator]
  25. 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
  26. 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
  27. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  28. 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
  29. def toString(): String
    Definition Classes
    AnyRef → Any
  30. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  31. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  32. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  2. 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 of value.formatted(formatString), or use the f"" string interpolator. In Java 15 and later, formatted resolves to the new method in String which has reversed parameters.

  3. 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.

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion ChainingOps fromGraphGen[N, E, G] to ChainingOps[GraphGen[N, E, G]]

Inherited by implicit conversion any2stringadd fromGraphGen[N, E, G] to any2stringadd[GraphGen[N, E, G]]

Inherited by implicit conversion StringFormat fromGraphGen[N, E, G] to StringFormat[GraphGen[N, E, G]]

Inherited by implicit conversion Ensuring fromGraphGen[N, E, G] to Ensuring[GraphGen[N, E, G]]

Inherited by implicit conversion ArrowAssoc fromGraphGen[N, E, G] to ArrowAssoc[GraphGen[N, E, G]]

Ungrouped