Packages

object GraphGen

Provides convenience metrics and methods for the generation of graphs by means of org.scalacheck.Arbitrary[G[N,E]].

Linear Supertypes
Content Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GraphGen
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. trait Metrics[N] extends MetricsBase[N]

    Represents graph metrics like order, nodeDegrees and connected excluding the type of nodes, edges and the type of the graph to be generated.

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def apply[N, E <: Edge[N], G[X, Y <: Edge[X]] <: AnyGraph[X, Y] with GraphLike[X, Y, G]](graphCompanion: GenericGraphFactory[G], order: Int, nodeGen: Gen[N], nodeDegrees: NodeDegreeRange, edgeCompanions: Set[EdgeCompanionBase], connected: Boolean, weightFactory: Option[Gen[Long]], labelFactory: Option[Gen[Any]])(implicit nodeTag: ClassTag[N]): GraphGen[N, E, G]
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  7. def diGraph[N, G[X, Y <: Edge[X]] <: AnyGraph[X, Y] with GraphLike[X, Y, G]](graphCompanion: GenericGraphFactory[G], metrics: Metrics[N])(implicit nodeTag: ClassTag[N]): Arbitrary[G[N, DiEdge[N]]]

    Returns an org.scalacheck.Arbitrary[G[N,DiEdge]] for non-labeled directed graphs of any metrics and any type.

    Returns an org.scalacheck.Arbitrary[G[N,DiEdge]] for non-labeled directed graphs of any metrics and any type.

    graphCompanion

    The graph companion object such as scalax.collection.Graph to be used to generate graphs.

    metrics

    The Metrics to be applied to the generated graph.

  8. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  9. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  10. def fromMetrics[N, E <: Edge[N], G[X, Y <: Edge[X]] <: AnyGraph[X, Y] with GraphLike[X, Y, G]](graphCompanion: GenericGraphFactory[G], metrics: Metrics[N], edgeCompanions: Set[EdgeCompanionBase])(implicit nodeTag: ClassTag[N]): GraphGen[N, E, G]
  11. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  12. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  13. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  14. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  16. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  17. def smallConnectedIntDi[G[X, Y <: Edge[X]] <: AnyGraph[X, Y] with GraphLike[X, Y, G]](graphCompanion: GenericGraphFactory[G]): Arbitrary[G[Int, DiEdge[Int]]]

    Returns an org.scalacheck.Arbitrary[G[Int,DiEdge]] for small, connected, non-labeled directed graphs with the metrics defined by SmallInt.

    Returns an org.scalacheck.Arbitrary[G[Int,DiEdge]] for small, connected, non-labeled directed graphs with the metrics defined by SmallInt.

    graphCompanion

    The graph companion object such as scalax.collection.Graph to be used to generate graphs.

  18. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  19. def tinyConnectedIntDi[G[X, Y <: Edge[X]] <: AnyGraph[X, Y] with GraphLike[X, Y, G]](graphCompanion: GenericGraphFactory[G]): Arbitrary[G[Int, DiEdge[Int]]]

    Returns an org.scalacheck.Arbitrary[G[Int,DiEdge]] for tiny, connected, non-labeled directed graphs with the metrics defined by TinyInt.

    Returns an org.scalacheck.Arbitrary[G[Int,DiEdge]] for tiny, connected, non-labeled directed graphs with the metrics defined by TinyInt.

    graphCompanion

    The graph companion object such as scalax.collection.Graph to be used to generate graphs.

  20. def toString(): String
    Definition Classes
    AnyRef → Any
  21. def unDiGraph[N, G[X, Y <: Edge[X]] <: AnyGraph[X, Y] with GraphLike[X, Y, G]](graphCompanion: GenericGraphFactory[G], metrics: Metrics[N])(implicit nodeTag: ClassTag[N]): Arbitrary[G[N, UnDiEdge[N]]]

    Returns an org.scalacheck.Arbitrary[G[N,UnDiEdge]] for non-labeled undirected graphs of any metrics and any type.

    Returns an org.scalacheck.Arbitrary[G[N,UnDiEdge]] for non-labeled undirected graphs of any metrics and any type.

    graphCompanion

    The graph companion object such as scalax.collection.Graph to be used to generate graphs.

    metrics

    The Metrics to be applied to the generated graph.

  22. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  23. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  24. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  25. object SmallInt extends Metrics[Int]

    Predefined metrics of a 'small' graph with the node type of Int, an order of 20 and a node degree range of 2 to 5 including org.scalacheck.Gen[Int].

  26. object TinyInt extends Metrics[Int]

    Predefined metrics of a 'tiny' graph with the node type of Int, an order of 5 and a node degree range of 2 to 4 including org.scalacheck.Gen[Int].

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated

Inherited from AnyRef

Inherited from Any

Ungrouped