The distinction between the cluster and DFS in node connectivity

Model The problem:

When modeling the problem, we should try to figure out what problems need to be solved. Because the data structures and algorithms selected in the model are obviously different depending on the problem, the problem that we need to address in terms of dynamic connectivity is:

• give two nodes to determine if they are connected, If you are connected, you do not need to give a specific path
• give two nodes to determine if they are connected, if connected, you need to give a specific path

In the case of the above two problems, although only can give the specific path difference, but this difference causes the choice algorithm the difference:

• In the first case, you do not need to give a specific path to use Union-find algorithm,
• The second case can be used based on DFS the algorithm.

The distinction between the cluster and DFS in node connectivity