题目描述:
某省调查城镇交通状况,得到现有城镇道路统计表,表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通(但不一定有直接的道路相连,只要互相间接通过道路可达即可)。问最少还需要建设多少条道路?
解题思路:
并查集思想
代码:
package lanqiao;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int x,y,n,m;
Scanner sc = new Scanner(System.in);
while(sc.hasNext())
{
n = sc.nextInt();
if(n == 0) break;
m = sc.nextInt();
disJionSet parent = new disJionSet();
parent.parent = new int[n + 1];
parent.disJoinSet();
for(int i = 1;i <= m;i ++)
{
x = sc.nextInt();
y = sc.nextInt();
parent.unite(x,y);
}
int cnt = 0;
for(int i = 1;i <= n;i ++)
{
if(parent.parent[i] == i)
{
cnt += 1;
}
}
System.out.println(cnt - 1);
}
}
public static class disJionSet{
int parent[];
void disJoinSet(){
for(int i = 0;i < parent.length;i ++)
{
parent[i] = i;
}
}
int find(int x)
{
if(parent[x] == x)
{
return x;
}
else{
return parent[x] = find(parent[x]);
}
}
boolean unite(int x,int y)
{
int rootX = find(x);
int rootY = find(y);
// System.out.println(rootX + " " + rootY);
if(rootX == rootY){
return false;
}
parent[rootY] = rootX;
return true;
}
}
}