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?

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?

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?