object TinyInt extends Metrics[Int]
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
including org.scalacheck.Gen[Int].
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- TinyInt
- Metrics
- MetricsBase
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- 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()
- def connected: Boolean
- Definition Classes
- MetricsBase
- lazy val divisor: Int
- Definition Classes
- MetricsBase
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- lazy val expectedTotalDegree: Int
- Definition Classes
- MetricsBase
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- lazy val isDense: Boolean
- Definition Classes
- MetricsBase
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- lazy val maxDegreeDeviation: Int
- Definition Classes
- MetricsBase
- def minMax: Int
- Attributes
- protected
- Definition Classes
- MetricsBase
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- val nodeDegrees: parameters.NodeDegreeRange
- Definition Classes
- TinyInt → MetricsBase
- val nodeGen: Gen[Int]
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- val order: Int
- Definition Classes
- TinyInt → MetricsBase
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- 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])
Welcome to the Graph for Scala API reference. Some suggested entry points:
AnyGraphimmutable.Graphand its inner nodesmutable.Graphand its inner nodes.edgespackage and its subpackageshyperedgespackage and its subpackages.labeled edgespackagemultilabeled edgespackagelabeled hyperedgespackagemultilabeled hyperedgespackageordered labeled hyperedgespackageordered multilabeled hyperedgesobjectgenericpackage.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.