class WeakComponentImpl extends (GraphTraversalImpl.this)#Component
- Attributes
- protected
- Alphabetic
- By Inheritance
- WeakComponentImpl
- Component
- Properties
- SubgraphProperties
- AnyRef
- Any
- by anyToNode
- by CollectionsHaveToParArray
- by EdgeAssoc
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- All
Instance Constructors
- new WeakComponentImpl(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)#WeakComponentImpl to any2stringadd[(GraphTraversalImpl.this)#WeakComponentImpl] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
-
def
->[B](y: B): ((GraphTraversalImpl.this)#WeakComponentImpl, B)
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#WeakComponentImpl to ArrowAssoc[(GraphTraversalImpl.this)#WeakComponentImpl] 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[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
lazy val
edges: Set[(GraphTraversalImpl.this)#EdgeT]
- Definition Classes
- Component
-
def
ensuring(cond: ((GraphTraversalImpl.this)#WeakComponentImpl) ⇒ Boolean, msg: ⇒ Any): (GraphTraversalImpl.this)#WeakComponentImpl
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#WeakComponentImpl to Ensuring[(GraphTraversalImpl.this)#WeakComponentImpl] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: ((GraphTraversalImpl.this)#WeakComponentImpl) ⇒ Boolean): (GraphTraversalImpl.this)#WeakComponentImpl
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#WeakComponentImpl to Ensuring[(GraphTraversalImpl.this)#WeakComponentImpl] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean, msg: ⇒ Any): (GraphTraversalImpl.this)#WeakComponentImpl
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#WeakComponentImpl to Ensuring[(GraphTraversalImpl.this)#WeakComponentImpl] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean): (GraphTraversalImpl.this)#WeakComponentImpl
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#WeakComponentImpl to Ensuring[(GraphTraversalImpl.this)#WeakComponentImpl] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#WeakComponentImpl to StringFormat[(GraphTraversalImpl.this)#WeakComponentImpl] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
-
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[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
isDefined: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#WeakComponentImpl to OuterNode[(GraphTraversalImpl.this)#WeakComponentImpl] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Param
-
def
isEdge: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#WeakComponentImpl to OuterNode[(GraphTraversalImpl.this)#WeakComponentImpl] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
-
def
isIn: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#WeakComponentImpl to OuterNode[(GraphTraversalImpl.this)#WeakComponentImpl] 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)#WeakComponentImpl to OuterNode[(GraphTraversalImpl.this)#WeakComponentImpl] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
-
def
isOut: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#WeakComponentImpl to OuterNode[(GraphTraversalImpl.this)#WeakComponentImpl] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- InParam → 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
- WeakComponentImpl → Component
-
val
n1: (GraphTraversalImpl.this)#WeakComponentImpl
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#WeakComponentImpl to EdgeAssoc[(GraphTraversalImpl.this)#WeakComponentImpl] 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
- WeakComponentImpl → Component
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
val
ordering: (GraphTraversalImpl.this)#ElemOrdering
If a
NodeOrdering
orEdgeOrdering
different fromNoOrdering
is supplied neighbor nodes will visited during the traversal according to this ordering.If a
NodeOrdering
orEdgeOrdering
different fromNoOrdering
is supplied neighbor nodes will visited during the traversal according to this ordering.- Definition Classes
- WeakComponentImpl → Properties
-
val
parameters: Parameters
The properties controlling subsequent traversals.
The properties controlling subsequent traversals.
- Definition Classes
- WeakComponentImpl → Properties
-
val
root: (GraphTraversalImpl.this)#NodeT
The node where subsequent graph traversals start.
The node where subsequent graph traversals start.
- Definition Classes
- WeakComponentImpl → Properties
-
def
stringPrefix: String
- Attributes
- protected
- Definition Classes
- WeakComponentImpl → 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
- WeakComponentImpl → 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
- WeakComponentImpl → SubgraphProperties
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
final
def
toGraph: Graph[N, E]
- Definition Classes
- Component
-
def
toParArray: ParArray[T]
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#WeakComponentImpl to CollectionsHaveToParArray[(GraphTraversalImpl.this)#WeakComponentImpl, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type ((GraphTraversalImpl.this)#WeakComponentImpl) ⇒ GenTraversableOnce[T] is in scope.
- Definition Classes
- CollectionsHaveToParArray
-
def
toString(): String
- Definition Classes
- Component → AnyRef → Any
-
val
value: (GraphTraversalImpl.this)#WeakComponentImpl
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#WeakComponentImpl to OuterNode[(GraphTraversalImpl.this)#WeakComponentImpl] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- OuterNode → NodeParam
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
~[N >: N1](n2: N): UnDiEdge[N]
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#WeakComponentImpl to EdgeAssoc[(GraphTraversalImpl.this)#WeakComponentImpl] 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)#WeakComponentImpl to EdgeAssoc[(GraphTraversalImpl.this)#WeakComponentImpl] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
-
def
→[B](y: B): ((GraphTraversalImpl.this)#WeakComponentImpl, B)
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#WeakComponentImpl to ArrowAssoc[(GraphTraversalImpl.this)#WeakComponentImpl] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
Shadowed Implicit Value Members
-
def
stringPrefix: String
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#WeakComponentImpl to OuterNode[(GraphTraversalImpl.this)#WeakComponentImpl] 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:(weakComponentImpl: OuterNode[(GraphTraversalImpl.this)#WeakComponentImpl]).stringPrefix
- Definition Classes
- NodeParam
-
def
toString(): String
- Implicit
- This member is added by an implicit conversion from (GraphTraversalImpl.this)#WeakComponentImpl to OuterNode[(GraphTraversalImpl.this)#WeakComponentImpl] 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:(weakComponentImpl: OuterNode[(GraphTraversalImpl.this)#WeakComponentImpl]).toString()
- Definition Classes
- NodeParam → AnyRef → Any
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graph
mutable.Graph
and its inner nodes.GraphEdge
objectedge
packageGraphPredef
object andImplicits
object.GraphTraversal
andTraverserInnerNode
.RandomGraph
.GraphGen
.