scalax.collection.generator

RandomGraph

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
AnyRef, Any
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. RandomGraph
  2. AnyRef
  3. Any
Implicitly
  1. by any2stringadd
  2. by any2stringfmt
  3. by any2ArrowAssoc
  4. by any2Ensuring
  1. Hide All
  2. Show all
Learn more about member selection
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] = scala.None, labelFactory: Option[() ⇒ Any] = scala.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.

  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: AnyRef): Boolean

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. def +(other: String): String

    Implicit information
    This member is added by an implicit conversion from RandomGraph[N, E, G] to StringAdd performed by method any2stringadd in scala.Predef.
    Definition Classes
    StringAdd

  5. def ->[B](y: B): (RandomGraph[N, E, G], B)

    Implicit information
    This member is added by an implicit conversion from RandomGraph[N, E, G] to ArrowAssoc[RandomGraph[N, E, G]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  8. object RandomEdge

    Attributes
    protected

  9. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  10. def clone(): AnyRef

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

  11. val doTrace: Boolean

    Attributes
    protected

  12. def draw: G[N, E]

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

  13. def empty: G[N, E]

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

  14. def ensuring(cond: (RandomGraph[N, E, G]) ⇒ Boolean, msg: ⇒ Any): RandomGraph[N, E, G]

    Implicit information
    This member is added by an implicit conversion from RandomGraph[N, E, G] to Ensuring[RandomGraph[N, E, G]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  15. def ensuring(cond: (RandomGraph[N, E, G]) ⇒ Boolean): RandomGraph[N, E, G]

    Implicit information
    This member is added by an implicit conversion from RandomGraph[N, E, G] to Ensuring[RandomGraph[N, E, G]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  16. def ensuring(cond: Boolean, msg: ⇒ Any): RandomGraph[N, E, G]

    Implicit information
    This member is added by an implicit conversion from RandomGraph[N, E, G] to Ensuring[RandomGraph[N, E, G]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

  17. def ensuring(cond: Boolean): RandomGraph[N, E, G]

    Implicit information
    This member is added by an implicit conversion from RandomGraph[N, E, G] to Ensuring[RandomGraph[N, E, G]] performed by method any2Ensuring in scala.Predef.
    Definition Classes
    Ensuring

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

    Definition Classes
    AnyRef

  19. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  20. def finalize(): Unit

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

  21. def formatted(fmtstr: String): String

    Implicit information
    This member is added by an implicit conversion from RandomGraph[N, E, G] to StringFormat performed by method any2stringfmt in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()

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

    Definition Classes
    AnyRef → Any

  23. val graphCompanion: GraphCompanion[G]

    The graph companion the factory method fromof which is to be called to create random graphs.

  24. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  25. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    AnyRef

  27. final def notify(): Unit

    Definition Classes
    AnyRef

  28. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  29. val order: Int

    The total number of nodes the generated random graph should contain.

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

    Definition Classes
    AnyRef

  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
    @throws( ... )

  37. def →[B](y: B): (RandomGraph[N, E, G], B)

    Implicit information
    This member is added by an implicit conversion from RandomGraph[N, E, G] to ArrowAssoc[RandomGraph[N, E, G]] performed by method any2ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. val self: Any

    Implicit information
    This member is added by an implicit conversion from RandomGraph[N, E, G] to StringAdd performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (randomGraph: StringAdd).self
    Definition Classes
    StringAdd

  2. val self: Any

    Implicit information
    This member is added by an implicit conversion from RandomGraph[N, E, G] to StringFormat performed by method any2stringfmt in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (randomGraph: StringFormat).self
    Definition Classes
    StringFormat

Deprecated Value Members

  1. def x: RandomGraph[N, E, G]

    Implicit information
    This member is added by an implicit conversion from RandomGraph[N, E, G] to ArrowAssoc[RandomGraph[N, E, G]] performed by method any2ArrowAssoc in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (randomGraph: ArrowAssoc[RandomGraph[N, E, G]]).x
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use leftOfArrow instead

  2. def x: RandomGraph[N, E, G]

    Implicit information
    This member is added by an implicit conversion from RandomGraph[N, E, G] to Ensuring[RandomGraph[N, E, G]] performed by method any2Ensuring in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (randomGraph: Ensuring[RandomGraph[N, E, G]]).x
    Definition Classes
    Ensuring
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use resultOfEnsuring instead

Inherited from AnyRef

Inherited from Any

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

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

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

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

Ungrouped