abstract class Component extends Properties
Represents a component of this graph.
Edges and bridges are computed lazily.
Components will be instantiated by componentTraverser or strongComponentTraverser.
Linear Supertypes
Known Subclasses
Ordering
- Alphabetic
- By Inheritance
Inherited
- Component
- Properties
- SubgraphProperties
- AnyRef
- Any
Implicitly
- by anyToNode
- by CollectionsHaveToParArray
- by EdgeAssoc
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
-
new
Component()
- Attributes
- protected
Abstract Value Members
-
abstract
def
mayHaveFrontierEdges: Boolean
- Attributes
- protected
- abstract def nodes: Set[NodeT]
-
abstract
def
ordering: GraphTraversal.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
- Properties
-
abstract
def
parameters: Parameters
The properties controlling subsequent traversals.
The properties controlling subsequent traversals.
- Definition Classes
- Properties
-
abstract
def
root: NodeT
The node where subsequent graph traversals start.
The node where subsequent graph traversals start.
- Definition Classes
- Properties
-
abstract
def
stringPrefix: String
- Attributes
- protected
-
abstract
def
subgraphEdges: GraphTraversal.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
- SubgraphProperties
-
abstract
def
subgraphNodes: GraphTraversal.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
- SubgraphProperties
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- def ->[B](y: B): (Component, B)
-
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[GraphTraversal.EdgeT]
- def ensuring(cond: (Component) ⇒ Boolean, msg: ⇒ Any): Component
- def ensuring(cond: (Component) ⇒ Boolean): Component
- def ensuring(cond: Boolean, msg: ⇒ Any): Component
- def ensuring(cond: Boolean): Component
-
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
- final def frontierEdges(that: Component): Set[GraphTraversal.EdgeT]
- final lazy val frontierEdges: Set[GraphTraversal.EdgeT]
-
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 Component to OuterNode[Component] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Param
-
def
isEdge: Boolean
- Implicit
- This member is added by an implicit conversion from Component to OuterNode[Component] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
- def isIn: Boolean
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isNode: Boolean
- Implicit
- This member is added by an implicit conversion from Component to OuterNode[Component] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- NodeParam
- def isOut: Boolean
-
def
maxWeight: Option[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
-
val
n1: Component
- Implicit
- This member is added by an implicit conversion from Component to EdgeAssoc[Component] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- final def toGraph: Graph[N, E]
-
def
toParArray: ParArray[T]
- Implicit
- This member is added by an implicit conversion from Component to CollectionsHaveToParArray[Component, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (Component) ⇒ GenTraversableOnce[T] is in scope.
- Definition Classes
- CollectionsHaveToParArray
-
def
toString(): String
- Definition Classes
- Component → AnyRef → Any
- val value: Component
-
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 Component to EdgeAssoc[Component] 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 Component to EdgeAssoc[Component] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
- def →[B](y: B): (Component, B)
Shadowed Implicit Value Members
-
def
stringPrefix: String
- Implicit
- This member is added by an implicit conversion from Component to OuterNode[Component] 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:(component: OuterNode[Component]).stringPrefix
- Definition Classes
- NodeParam
-
def
toString(): String
- Implicit
- This member is added by an implicit conversion from Component to OuterNode[Component] 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:(component: OuterNode[Component]).toString()
- Definition Classes
- NodeParam → AnyRef → Any
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graphmutable.Graphand its inner nodes.GraphEdgeobjectedgepackageGraphPredefobject andImplicitsobject.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.