Packages

abstract class RandomGraph[N, E[X] <: EdgeLikeIn[X], G[X, Y[Z] <: EdgeLikeIn[Z]] <: Graph[X, Y[Z]] with GraphLike[X, Y[Z], G]] extends AnyRef

Supports random graph creation for graphs of any type with variable metrics.

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
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RandomGraph
  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. All

Instance Constructors

  1. new RandomGraph(graphCompanion: GraphCompanion[G], order: Int, nodeFactory: ⇒ N, nodeDegree: NodeDegreeRange, edgeCompanions: Set[EdgeCompanionBase[E]], connected: Boolean, weightFactory: Option[() ⇒ Long] = None, labelFactory: Option[() ⇒ 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 graph should contain.

    nodeFactory

    The function responsible for generating nodes.

    nodeDegree

    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.

Type Members

  1. final class DefaultLabelFactory extends AnyRef

    A stateful String generator with deterministic results.

    A stateful String generator with deterministic results.

    Attributes
    protected
  2. final class DefaultWeightFactory extends AnyRef
    Attributes
    protected
  3. final class Degrees extends AnyRef
    Attributes
    protected
  4. final class OuterElems extends AnyRef
    Attributes
    protected
  5. final class OuterNodes extends AnyRef
    Attributes
    protected
  6. class RandomEdge extends AnyRef
    Attributes
    protected

Abstract Value Members

  1. implicit abstract val graphConfig: Config

Concrete 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 RandomGraph[N, E, G] to any2stringadd[RandomGraph[N, E, G]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (RandomGraph[N, E, G], B)
    Implicit
    This member is added by an implicit conversion from RandomGraph[N, E, G] to ArrowAssoc[RandomGraph[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. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  8. val doTrace: Boolean
    Attributes
    protected
  9. def draw: G[N, E]

    Returns a random graph of the specified type and with the metrics passed to the enclosing class.

  10. def empty: G[N, E]

    Returns an empty graph of the type as specified for the enclosing class.

  11. def ensuring(cond: (RandomGraph[N, E, G]) ⇒ Boolean, msg: ⇒ Any): RandomGraph[N, E, G]
    Implicit
    This member is added by an implicit conversion from RandomGraph[N, E, G] to Ensuring[RandomGraph[N, E, G]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  12. def ensuring(cond: (RandomGraph[N, E, G]) ⇒ Boolean): RandomGraph[N, E, G]
    Implicit
    This member is added by an implicit conversion from RandomGraph[N, E, G] to Ensuring[RandomGraph[N, E, G]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  13. def ensuring(cond: Boolean, msg: ⇒ Any): RandomGraph[N, E, G]
    Implicit
    This member is added by an implicit conversion from RandomGraph[N, E, G] to Ensuring[RandomGraph[N, E, G]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  14. def ensuring(cond: Boolean): RandomGraph[N, E, G]
    Implicit
    This member is added by an implicit conversion from RandomGraph[N, E, G] to Ensuring[RandomGraph[N, E, G]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  15. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  16. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  17. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  18. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from RandomGraph[N, E, G] to StringFormat[RandomGraph[N, E, G]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  19. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  20. val graphCompanion: GraphCompanion[G]
  21. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  22. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  23. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  24. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  25. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  26. val order: Int
  27. def pipe[B](f: (RandomGraph[N, E, G]) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from RandomGraph[N, E, G] to ChainingOps[RandomGraph[N, E, G]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  28. val self: RandomGraph[N, E, G]
    Implicit
    This member is added by an implicit conversion from RandomGraph[N, E, G] to ChainingOps[RandomGraph[N, E, G]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  29. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  30. def tap[U](f: (RandomGraph[N, E, G]) ⇒ U): RandomGraph[N, E, G]
    Implicit
    This member is added by an implicit conversion from RandomGraph[N, E, G] to ChainingOps[RandomGraph[N, E, G]] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  31. def toString(): String
    Definition Classes
    AnyRef → Any
  32. def trace(str: ⇒ String): Unit
    Attributes
    protected
  33. def traceln(str: ⇒ String): Unit
    Attributes
    protected
  34. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  35. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  36. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  37. def [B](y: B): (RandomGraph[N, E, G], B)
    Implicit
    This member is added by an implicit conversion from RandomGraph[N, E, G] to ArrowAssoc[RandomGraph[N, E, G]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
  38. object RandomEdge
    Attributes
    protected

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion ChainingOps from RandomGraph[N, E, G] to ChainingOps[RandomGraph[N, E, G]]

Inherited by implicit conversion any2stringadd from RandomGraph[N, E, G] to any2stringadd[RandomGraph[N, E, G]]

Inherited by implicit conversion StringFormat from RandomGraph[N, E, G] to StringFormat[RandomGraph[N, E, G]]

Inherited by implicit conversion Ensuring from RandomGraph[N, E, G] to Ensuring[RandomGraph[N, E, G]]

Inherited by implicit conversion ArrowAssoc from RandomGraph[N, E, G] to ArrowAssoc[RandomGraph[N, E, G]]

Ungrouped