[pgrouting-users] Can pgr_connectedComponents be used to find isolated vertices?

[glad.pen2421 at fastmail.com]

Dear fellow pgRouting users,

As per the description of `pgr_connectedComponents`, it runs a breadth-first search to find sets of vertices "that are all reachable from each other".

Does that mean that if `pgr_connectedComponents` results in more than one connected component, some vertices are definitely not reachable from each other?

Can this be a way to guarantee that with more than 1 connected component it is guaranteed that algorithms like `pgr_dijkstra` will definitely fail on some pairs of vertices?

Thank you.

GP

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.osgeo.org/pipermail/pgrouting-users/attachments/20230802/160b9d5c/attachment.htm>