Home | Documentation | Download | Platforms | Projects | Mailing Lists | Version History


Public Member Functions | |
| components () | |
| Creates connected components algorithm object. | |
| virtual | ~components () |
| Destroys connected components algorithm object. | |
| virtual int | check (graph &G) |
| Checks whether the connected components algorithm can be applied. | |
| virtual void | reset () |
| Resets algorithm. | |
| component_iterator | components_begin () |
| Start iteration over all components (if enabled during last call to run). | |
| component_iterator | components_end () |
| End of iteration over all components. | |
| int | number_of_components () const |
| Number of components detected during the last run. | |
| virtual void | before_recursive_call_handler (graph &, edge &, node &) |
| Handler called when a unused node n connected to the actual node by e is found. | |
| virtual void | old_adj_node_handler (graph &, edge &, node &) |
| Handler called when a already marked node n connected to the actual node by e is found during the search of all adjacent edges of the actual node. | |
| virtual void | new_start_handler (graph &, node &) |
| Called when DFS is started with start-node n. | |
| components::components | ( | ) |
| virtual components::~components | ( | ) | [inline, virtual] |
| virtual int components::check | ( | graph & | G | ) | [virtual] |
Checks whether the connected components algorithm can be applied.
Necessary preconditions:
| G | graph. |
Reimplemented from dfs.
| virtual void components::reset | ( | ) | [virtual] |
Resets algorithm.
Prepares the algorithm to be applied to another graph. Please note: The options an algorithm may support do not get reset by this. It is just to reset internally used datastructures.
Reimplemented from dfs.
| component_iterator components::components_begin | ( | ) | [inline] |
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> >.
| component_iterator components::components_end | ( | ) | [inline] |
End of iteration over all components.
| int components::number_of_components | ( | ) | const [inline] |
Handler called when a unused node n connected to the actual node by e is found.
| G | graph for which DFS was invoked. | |
| e | edge connecting the actual node to the unused one. | |
| n | unused node. |
Reimplemented from dfs.
Handler called when a already marked node n connected to the actual node by e is found during the search of all adjacent edges of the actual node.
| G | graph for which DFS was invoked. | |
| e | edge connecting the actual node to the old one. | |
| n | used node. |
Reimplemented from dfs.
Called when DFS is started with start-node n.
This is particularly useful when DFS was invoked with the scan_whole_graph option.
| G | graph for which DFS was invoked. | |
| n | start-node. |
Reimplemented from dfs.
University of Passau - FMI - Theoretical Computer Science