Graph Core
2.0.2
API
Generated with
Graph Core/scalax.collection/GraphTraversalImpl/StrongComponentImpl

StrongComponentImpl

scalax.collection.GraphTraversalImpl.StrongComponentImpl
protected class StrongComponentImpl(val root: NodeT, val parameters: Parameters, val subgraphNodes: NodePredicate, val subgraphEdges: EdgePredicate, val ordering: ElemOrdering, val nodes: Set[NodeT]) extends Component

Attributes

Graph
Supertypes
class Component
class Object
trait Matchable
class Any

Members list

Value members

Inherited methods

final def edges: Set[EdgeT]

Attributes

Inherited from:
Component
final def frontierEdges(that: Component): Set[EdgeT]

Attributes

Inherited from:
Component
final def frontierEdges: Set[EdgeT]

Attributes

Inherited from:
Component
def maxWeight: Option[Weight]

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.

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.

Attributes

Inherited from:
Properties (hidden)
final def to[G <: ([NN, EE <: Edge[NN]] =>> AnyGraph[NN, EE] & GraphLike[NN, EE, LazyRef(...)])](factory: GenericGraphCoreFactory[G]): G[N, E]

Attributes

Inherited from:
Component
override def toString: String

Returns a string representation of the object.

Returns a string representation of the object.

The default representation is platform dependent.

Attributes

Returns

a string representation of the object.

Definition Classes
Component -> Any
Inherited from:
Component

Concrete fields

override val nodes: Set[NodeT]
override val ordering: ElemOrdering

If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

If a NodeOrdering or EdgeOrdering different from NoOrdering is supplied neighbor nodes will visited during the traversal according to this ordering.

Attributes

override val parameters: Parameters

The properties controlling subsequent traversals.

The properties controlling subsequent traversals.

Attributes

override val root: NodeT

The node where subsequent graph traversals start.

The node where subsequent graph traversals start.

Attributes

override val subgraphEdges: EdgePredicate

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.

Attributes

override val subgraphNodes: NodePredicate

Restricts subsequent graph traversals to visit only nodes holding this predicate.

Restricts subsequent graph traversals to visit only nodes holding this predicate.

Attributes

Generated with