object State
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- State
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Type Members
- final class FlagStore extends Serializable
- Attributes
- protected
- type FlagWord = Long
Word of flags, that is unit of bitwise boolean state information.
Word of flags, that is unit of bitwise boolean state information. These flags are mainly used to store whether a node counts as visited with respect to a given traversal where each traversal is represented by a
Handle. - type FlagWords = ExtBitSet
Growable collection for storing bitwise boolean state information as an extension of
FlagsWord. - class GraphDump extends AnyRef
Represents state flags of a graph for dump purposes.
- class Handle extends AnyRef
state accessor with respect to a given traversal.
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 dump[N, E <: Edge[N]](graph: AnyGraph[N, E]): GraphDump
Dumps the state flags of a
graph. - def dump[N, E <: Edge[N]](node: AnyGraph.NodeT): ExtBitSet
Dumps the state flags of a
node. - def emptyHandle: Handle
- 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()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def initFlagSet: ExtBitSet
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- val minBitsForClear: Int
- Attributes
- protected
- val minBitsForClearExt: Int
- Attributes
- protected
- 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 nrOfFlagWordBits: Int
- Attributes
- protected
- val singleWord: Int
- 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.