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
Type Hierarchy
Ordering
- Alphabetic
- By Inheritance
Inherited
- RandomGraph
- AnyRef
- Any
Implicitly
- by ChainingOps
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
Visibility
- Public
- Protected
Instance Constructors
- 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
- final class DefaultLabelFactory extends AnyRef
A stateful String generator with deterministic results.
A stateful String generator with deterministic results.
- Attributes
- protected
- final class DefaultWeightFactory extends AnyRef
- Attributes
- protected
- final class Degrees extends AnyRef
- Attributes
- protected
- final class OuterElems extends AnyRef
- Attributes
- protected
- final class OuterNodes extends AnyRef
- Attributes
- protected
- class RandomEdge extends AnyRef
- Attributes
- protected
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- Implicit
- This member is added by an implicit conversion from RandomGraph[N, E, G] toany2stringadd[RandomGraph[N, E, G]] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
- def ->[B](y: B): (RandomGraph[N, E, G], B)
- Implicit
- This member is added by an implicit conversion from RandomGraph[N, E, G] toArrowAssoc[RandomGraph[N, E, G]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- val doTrace: Boolean
- Attributes
- protected
- def draw: G[N, E]
Returns a random graph of the specified type and with the metrics passed to the enclosing class.
- def empty: G[N, E]
Returns an empty graph of the type as specified for the enclosing class.
- 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] toEnsuring[RandomGraph[N, E, G]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- 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] toEnsuring[RandomGraph[N, E, G]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean, msg: => Any): RandomGraph[N, E, G]
- Implicit
- This member is added by an implicit conversion from RandomGraph[N, E, G] toEnsuring[RandomGraph[N, E, G]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean): RandomGraph[N, E, G]
- Implicit
- This member is added by an implicit conversion from RandomGraph[N, E, G] toEnsuring[RandomGraph[N, E, G]] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- val graphCompanion: GraphCompanion[G]
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- val order: Int
- def pipe[B](f: (RandomGraph[N, E, G]) => B): B
- Implicit
- This member is added by an implicit conversion from RandomGraph[N, E, G] toChainingOps[RandomGraph[N, E, G]] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- val self: RandomGraph[N, E, G]
- Implicit
- This member is added by an implicit conversion from RandomGraph[N, E, G] toChainingOps[RandomGraph[N, E, G]] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- 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] toChainingOps[RandomGraph[N, E, G]] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- def toString(): String
- Definition Classes
- AnyRef → Any
- def trace(str: => String): Unit
- Attributes
- protected
- def traceln(str: => String): Unit
- Attributes
- protected
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- object RandomEdge
- Attributes
- protected
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
- def formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from RandomGraph[N, E, G] toStringFormat[RandomGraph[N, E, G]] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.12.16) Use
formatString.format(value)instead ofvalue.formatted(formatString), or use thef""string interpolator. In Java 15 and later,formattedresolves to the new method in String which has reversed parameters.
- def →[B](y: B): (RandomGraph[N, E, G], B)
- Implicit
- This member is added by an implicit conversion from RandomGraph[N, E, G] toArrowAssoc[RandomGraph[N, E, G]] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use
->instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graphmutable.Graphand its inner nodes.GraphEdgeobjectedgepackageGraphPredefobject andImplicitsobject.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.