Opened 15 years ago
Last modified 13 years ago
#374 new enhancement
Functions for weakly connected components
| Reported by: | Peter Kovacs | Owned by: | Alpar Juttner | 
|---|---|---|---|
| Priority: | major | Milestone: | LEMON 1.4 release | 
| Component: | core | Version: | hg main | 
| Keywords: | Cc: | ||
| Revision id: | 
Description
I suggest to have the following functions:
bool weaklyConnected (const Digraph &graph); int countWeaklyConnectedComponents (const Digraph &graph); int weaklyConnectedComponents (const Digraph &graph, NodeMap &compMap);
which would work the same way as connected(), countConnectedComponents() and connectedComponents() for the undirected version of the digraph.
These proposed functions could be implemented easily using the Undirector adaptor and the undirected connectivity tools.
Change History (1)
comment:1 Changed 13 years ago by
| Milestone: | LEMON 1.3 release → LEMON 1.4 release | 
|---|
Note: See
        TracTickets for help on using
        tickets.
    
