components Class Reference

[Index] [Hierarchy] [Headers]

Connected components More...

#include <GTL/components.h>

Inherits: dfs

Public Members

• components()
• virtual ~components()
• virtual int check(graph& G)
• virtual void reset()
• component_iterator components_begin()
• component_iterator components_end()
• int number_of_components() const

components() [public]

Creates connected components algorithm object.

See Also:

dfs::dfs

~components() [public virtual]

Destroys connected components algorithm object.

See Also:

dfs::~dfs

int check(graph& G) [public virtual]

Necessary preconditions:

• G is undirected.
• scanning of whole graph is enabled.
• DFS may be applied

Parameters:

G

graph.

Returns:

algorithm::GTL_OK if connected components can be computed for G.

See Also:

dfs::scan_whole_graph

void reset() [public virtual]

Reset

component_iterator components_begin() [public]

Start iteration over all components (if enabled during last call to run). Components are represented as a pair consisting of a list of nodes and a list of edges, i.e. if it is of type component_iterator then *it is of type pair<list<node>,list<edge> >.

Returns:

iterator to first component

component_iterator components_end() [public]

End of iteration over all components.

Returns:

end of iteration over biconnected components

See Also:

biconnectivity::store_components

int number_of_components() const [public]

Number of components detected during the last run.

Returns:

number of components.