object
RandomGraph
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
-
-
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: scala.reflect.api.JavaUniverse.TypeTag[E[N]], nodeTag: ClassTag[N]): RandomGraph[N, E, G]
-
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: scala.reflect.api.JavaUniverse.TypeTag[E[N]], nodeTag: ClassTag[N]): RandomGraph[N, E, G]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
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: scala.reflect.api.JavaUniverse.TypeTag[DiEdge[N]], nodeTag: ClassTag[N]): RandomGraph[N, DiEdge, G]
-
-
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
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]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
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]
-
def
toString(): String
-
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: scala.reflect.api.JavaUniverse.TypeTag[UnDiEdge[N]], nodeTag: ClassTag[N]): RandomGraph[N, UnDiEdge, G]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Provides convenience metrics and methods for the generation of random graphs.