Object/Class

scalax.collection.generator

GraphGen

Related Docs: class GraphGen | package generator

Permalink

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 Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. GraphGen
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Type Members

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

    Permalink

    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

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. object SmallInt extends Metrics[Int]

    Permalink

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

  5. object TinyInt extends Metrics[Int]

    Permalink

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

  6. def apply[N, E[X] <: EdgeLikeIn[X], G[X, Y[Z] <: EdgeLikeIn[Z]] <: Graph[X, Y[Z]] with GraphLike[X, Y[Z], G]](graphCompanion: GraphCompanion[G], metrics: Metrics[N], edgeCompanions: Set[EdgeCompanionBase[E]])(implicit edgeTag: ClassTag[E[N]], nodeTag: ClassTag[N]): GraphGen[N, E, G]

    Permalink
  7. def apply[N, E[X] <: EdgeLikeIn[X], G[X, Y[Z] <: EdgeLikeIn[Z]] <: Graph[X, Y[Z]] with GraphLike[X, Y[Z], G]](graphCompanion: GraphCompanion[G], order: Int, nodeGen: Gen[N], nodeDegrees: NodeDegreeRange, edgeCompanions: Set[EdgeCompanionBase[E]], connected: Boolean, weightFactory: Option[Gen[Long]], labelFactory: Option[Gen[Any]])(implicit edgeTag: ClassTag[E[N]], nodeTag: ClassTag[N]): GraphGen[N, E, G]

    Permalink
  8. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  9. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. def diGraph[N, G[N, E[X] <: EdgeLikeIn[X]] <: Graph[N, E[X]] with GraphLike[N, E[X], G]](graphCompanion: GraphCompanion[G], metrics: Metrics[N])(implicit edgeTag: ClassTag[DiEdge[N]], nodeTag: ClassTag[N]): Arbitrary[G[N, DiEdge]]

    Permalink

    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.

    metrics

    The Metrics to be applied to the generated graph.

  11. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  12. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  13. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  15. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  16. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  17. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  18. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  19. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  20. def smallConnectedIntDi[G[N, E[X] <: EdgeLikeIn[X]] <: Graph[N, E[X]] with GraphLike[N, E[X], G]](graphCompanion: GraphCompanion[G]): Arbitrary[G[Int, DiEdge]]

    Permalink

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

  21. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  22. def tinyConnectedIntDi[G[N, E[X] <: EdgeLikeIn[X]] <: Graph[N, E[X]] with GraphLike[N, E[X], G]](graphCompanion: GraphCompanion[G]): Arbitrary[G[Int, DiEdge]]

    Permalink

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

  23. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  24. def unDiGraph[N, G[N, E[X] <: EdgeLikeIn[X]] <: Graph[N, E[X]] with GraphLike[N, E[X], G]](graphCompanion: GraphCompanion[G], metrics: Metrics[N])(implicit edgeTag: ClassTag[UnDiEdge[N]], nodeTag: ClassTag[N]): Arbitrary[G[N, UnDiEdge]]

    Permalink

    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.

    metrics

    The Metrics to be applied to the generated graph.

  25. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  26. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped