Connected components algorithms are used to analyze graph and solve problems (like 2-satisfiability problem). There are three parts of connected components algorithms in the Boost Graph Library (BGL),
- Connected components algorithm.
- Strongly connected components algorithm.
- Biconnected components algorithm.
I am proposing to add those BGL functionalities to pgRouting during this GSoC period.