class StrongComponentImpl extends (GraphTraversalImpl.this)#Component
- Attributes
- protected
Linear Supertypes
Type Hierarchy
Ordering
- Alphabetic
- By Inheritance
Inherited
- StrongComponentImpl
- Component
- Properties
- SubgraphProperties
- AnyRef
- Any
Implicitly
- by ChainingOps
- by EdgeAssoc
- by anyToNode
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
Visibility
- Public
- Protected
Instance Constructors
- new StrongComponentImpl(root: (GraphTraversalImpl.this)#NodeT, parameters: Parameters, subgraphNodes: (GraphTraversalImpl.this)#NodeFilter, subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter, ordering: (GraphTraversalImpl.this)#ElemOrdering, nodes: Set[(GraphTraversalImpl.this)#NodeT])
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 (GraphTraversalImpl.this)#StrongComponentImpl toany2stringadd[(GraphTraversalImpl.this)#StrongComponentImpl] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
- def ->[B](y: B): ((GraphTraversalImpl.this)#StrongComponentImpl, B)
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentImpl toArrowAssoc[(GraphTraversalImpl.this)#StrongComponentImpl] 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()
- final lazy val edges: Set[(GraphTraversalImpl.this)#EdgeT]
- Definition Classes
- Component
- def ensuring(cond: ((GraphTraversalImpl.this)#StrongComponentImpl) => Boolean, msg: => Any): (GraphTraversalImpl.this)#StrongComponentImpl
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentImpl toEnsuring[(GraphTraversalImpl.this)#StrongComponentImpl] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: ((GraphTraversalImpl.this)#StrongComponentImpl) => Boolean): (GraphTraversalImpl.this)#StrongComponentImpl
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentImpl toEnsuring[(GraphTraversalImpl.this)#StrongComponentImpl] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean, msg: => Any): (GraphTraversalImpl.this)#StrongComponentImpl
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentImpl toEnsuring[(GraphTraversalImpl.this)#StrongComponentImpl] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
- def ensuring(cond: Boolean): (GraphTraversalImpl.this)#StrongComponentImpl
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentImpl toEnsuring[(GraphTraversalImpl.this)#StrongComponentImpl] 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 frontierEdges(that: (GraphTraversalImpl.this)#Component): Set[(GraphTraversalImpl.this)#EdgeT]
- Definition Classes
- Component
- final lazy val frontierEdges: Set[(GraphTraversalImpl.this)#EdgeT]
- Definition Classes
- Component
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def isDefined: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentImpl toOuterNode[(GraphTraversalImpl.this)#StrongComponentImpl] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Param
- final def isEdge: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentImpl toOuterNode[(GraphTraversalImpl.this)#StrongComponentImpl] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Param
- def isIn: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentImpl toOuterNode[(GraphTraversalImpl.this)#StrongComponentImpl] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- InParam → Param
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isNode: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentImpl toOuterNode[(GraphTraversalImpl.this)#StrongComponentImpl] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
- final def isOut: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentImpl toOuterNode[(GraphTraversalImpl.this)#StrongComponentImpl] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Param
- def maxWeight: Option[(GraphTraversalImpl.this)#Weight]
An optional maximum weight that limits the scope of the traversal or search.
An optional maximum weight that limits the scope of the traversal or search. If defined and the sum of edge weights between the root of the traversal and a node exceeds the given maximum, that node will no more be visited.
- Definition Classes
- Properties
- final def mayHaveFrontierEdges: Boolean
- Attributes
- protected
- Definition Classes
- StrongComponentImpl → Component
- val n1: (GraphTraversalImpl.this)#StrongComponentImpl
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentImpl toEdgeAssoc[(GraphTraversalImpl.this)#StrongComponentImpl] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- val nodes: Set[(GraphTraversalImpl.this)#NodeT]
- Definition Classes
- StrongComponentImpl → Component
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- val ordering: (GraphTraversalImpl.this)#ElemOrdering
If a
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.If a
NodeOrderingorEdgeOrderingdifferent fromNoOrderingis supplied neighbor nodes will visited during the traversal according to this ordering.- Definition Classes
- StrongComponentImpl → Properties
- val parameters: Parameters
The properties controlling subsequent traversals.
The properties controlling subsequent traversals.
- Definition Classes
- StrongComponentImpl → Properties
- def pipe[B](f: ((GraphTraversalImpl.this)#StrongComponentImpl) => B): B
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentImpl toChainingOps[(GraphTraversalImpl.this)#StrongComponentImpl] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- def productElementNames: Iterator[String]
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentImpl toOuterNode[(GraphTraversalImpl.this)#StrongComponentImpl] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Product
- val root: (GraphTraversalImpl.this)#NodeT
The node where subsequent graph traversals start.
The node where subsequent graph traversals start.
- Definition Classes
- StrongComponentImpl → Properties
- val self: (GraphTraversalImpl.this)#StrongComponentImpl
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentImpl toChainingOps[(GraphTraversalImpl.this)#StrongComponentImpl] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- def stringPrefix: String
- Attributes
- protected
- Definition Classes
- StrongComponentImpl → Component
- val subgraphEdges: (GraphTraversalImpl.this)#EdgeFilter
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
Restricts subsequent graph traversals to walk only along edges that hold this predicate.
- Definition Classes
- StrongComponentImpl → SubgraphProperties
- val subgraphNodes: (GraphTraversalImpl.this)#NodeFilter
Restricts subsequent graph traversals to visit only nodes holding this predicate.
Restricts subsequent graph traversals to visit only nodes holding this predicate.
- Definition Classes
- StrongComponentImpl → SubgraphProperties
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tap[U](f: ((GraphTraversalImpl.this)#StrongComponentImpl) => U): (GraphTraversalImpl.this)#StrongComponentImpl
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentImpl toChainingOps[(GraphTraversalImpl.this)#StrongComponentImpl] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- final def to[G[NN, EE[+X] <: EdgeLikeIn[X]] <: Graph[NN, EE[X]] with GraphLike[NN, EE[X], G]](factory: GraphCoreCompanion[G]): G[N, E]
- Definition Classes
- Component
- def toString(): String
- Definition Classes
- Component → AnyRef → Any
- val value: (GraphTraversalImpl.this)#StrongComponentImpl
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentImpl toOuterNode[(GraphTraversalImpl.this)#StrongComponentImpl] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- OuterNode → NodeParam
- 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])
- def ~[N >: N1](n2: N): UnDiEdge[N]
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentImpl toEdgeAssoc[(GraphTraversalImpl.this)#StrongComponentImpl] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
- def ~>[N >: N1](n2: N): DiEdge[N]
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentImpl toEdgeAssoc[(GraphTraversalImpl.this)#StrongComponentImpl] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
Shadowed Implicit Value Members
- def stringPrefix: String
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentImpl toOuterNode[(GraphTraversalImpl.this)#StrongComponentImpl] performed by method anyToNode in scalax.collection.GraphPredef.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(strongComponentImpl: OuterNode[(GraphTraversalImpl.this)#StrongComponentImpl]).stringPrefix
- Definition Classes
- NodeParam
- def toString(): String
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentImpl toOuterNode[(GraphTraversalImpl.this)#StrongComponentImpl] performed by method anyToNode in scalax.collection.GraphPredef.
- Shadowing
- This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:(strongComponentImpl: OuterNode[(GraphTraversalImpl.this)#StrongComponentImpl]).toString()
- Definition Classes
- NodeParam → AnyRef → Any
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 (GraphTraversalImpl.this)#StrongComponentImpl toStringFormat[(GraphTraversalImpl.this)#StrongComponentImpl] 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): ((GraphTraversalImpl.this)#StrongComponentImpl, B)
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#StrongComponentImpl toArrowAssoc[(GraphTraversalImpl.this)#StrongComponentImpl] 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.