Graph Core
2.0.2
API
Generated with
Graph Core/scalax.collection/GraphTraversal/Component

Component

scalax.collection.GraphTraversal.Component
abstract class Component()

Represents a component of this graph. Edges and bridges are computed lazily. Components will be instantiated by componentTraverser or strongComponentTraverser.

Attributes

Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes

Members list

Value members

Abstract methods

protected def className: String
protected def mayHaveFrontierEdges: Boolean
def nodes: Set[NodeT]

Concrete methods

final def edges: Set[EdgeT]
final def frontierEdges: Set[EdgeT]
final def frontierEdges(that: Component): Set[EdgeT]
final def to[G <: ([NN, EE <: Edge[NN]] =>> AnyGraph[NN, EE] & GraphLike[NN, EE, LazyRef(...)])](factory: GenericGraphCoreFactory[G]): G[N, E]
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
Any

Inherited methods

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)
def 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

Inherited from:
Properties (hidden)
def parameters: Parameters

The properties controlling subsequent traversals.

The properties controlling subsequent traversals.

Attributes

Inherited from:
Properties (hidden)
def root: NodeT

The node where subsequent graph traversals start.

The node where subsequent graph traversals start.

Attributes

Inherited from:
Properties (hidden)
def 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

Inherited from:
SubgraphProperties (hidden)
def 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

Inherited from:
SubgraphProperties (hidden)
Generated with