scalax.collection.generator

RandomGraph

object RandomGraph

Provides convenience metrics and methods for the generation of random graphs.

Linear Supertypes
AnyRef, Any
Content Hierarchy Learn more about scaladoc diagrams
SmallIntTinyIntIntFactoryMetrics[N]MetricsBase[N]
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. RandomGraph
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. trait IntFactory extends Metrics[Int]

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

  3. trait MetricsBase[N] extends AnyRef

    Template for Metrics with connected set to true and some lazy values useful for checking the metrics of generated graphs.

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  6. object SmallInt extends IntFactory

    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.

  7. object TinyInt extends IntFactory

    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.

  8. 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]): RandomGraph[N, E, G]

  9. 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, nodeFactory: ⇒ N, nodeDegree: NodeDegreeRange, edgeCompanions: Set[EdgeCompanionBase[E]], connected: Boolean, weightFactory: Option[() ⇒ Long], labelFactory: Option[() ⇒ Any])(implicit edgeTag: ClassTag[E[N]], nodeTag: ClassTag[N]): RandomGraph[N, E, G]

  10. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  11. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  12. 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]): RandomGraph[N, DiEdge, G]

    Returns a generator for non-labeled directed graphs of any metrics and any type.

    Returns a generator for non-labeled directed graphs of any metrics and any type.

    metrics

    The Metrics to be applied to the generated graph.

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

    Definition Classes
    AnyRef

  14. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  15. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  16. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  17. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  18. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  19. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  20. final def notify(): Unit

    Definition Classes
    AnyRef

  21. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  22. def smallConnectedIntDi[G[N, E[X] <: EdgeLikeIn[X]] <: Graph[N, E[X]] with GraphLike[N, E[X], G]](graphCompanion: GraphCompanion[G]): RandomGraph[Int, DiEdge, G]

    Returns a generator for small, connected, non-labeled directed graphs with the metrics defined by SmallInt.

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

    Definition Classes
    AnyRef

  24. def tinyConnectedIntDi[G[N, E[X] <: EdgeLikeIn[X]] <: Graph[N, E[X]] with GraphLike[N, E[X], G]](graphCompanion: GraphCompanion[G]): RandomGraph[Int, DiEdge, G]

    Returns a generator for tiny, connected, non-labeled directed graphs with the metrics defined by TinyInt.

  25. def toString(): String

    Definition Classes
    AnyRef → Any

  26. 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]): RandomGraph[N, UnDiEdge, G]

    Returns a generator for non-labeled undirected graphs of any metrics and any type.

    Returns a generator for non-labeled undirected graphs of any metrics and any type.

    metrics

    The Metrics to be applied to the generated graph.

  27. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  28. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  29. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped