algorithms/Java/DisjointSetUnion.java at master · AASF-IIITM/algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
classGFG
{
staticintN = 100010;

staticclassEdge
{
intu, v;

publicEdge(intu, intv)
	{
this.u = u;
this.v = v;
	}
}


staticint []id = newint[N];
staticint []sz = newint[N];


staticintRoot(intidx)
{
inti = idx;

while(i != id[i])
	{
id[i] = id[id[i]];
i = id[i];
	}
returni;
}


staticvoidUnion(inta, intb)
{
inti = Root(a), j = Root(b);

if (i != j)
	{
if(sz[i] >= sz[j])
 {
id[j] = i;
sz[i] += sz[j];
sz[j] = 0;
 }
else
 {
id[i] = j;
sz[j] += sz[i];
sz[i] = 0;
 }
	}
}


staticvoidUnionUtil(Edgee[], intW[], intq)
{
for(inti = 0; i < q; i++)
	{

intu, v;
u = e[i].u;
v = e[i].v;


u--;
v--;


if(W[u] % 2 == 0 && W[v] % 2 == 0)
Union(u, v);
	}
}


staticintfindMax(intn, intW[])
{
intmaxi = 0;
for(inti = 1; i < n; i++)
if(W[i] % 2 == 0)
maxi = Math.max(maxi, sz[i]);

returnmaxi;
}


publicstaticvoidmain(String[] args)
{


intW[] = {1, 2, 6, 4, 2, 0, 3};


intn = W.length;


for(inti = 0; i < n; i++)
	{
id[i] = i;
sz[i] = 1;
	}

Edgee[] = {newEdge(1, 2), newEdge(1, 3),
newEdge(2, 4), newEdge(2, 5),
newEdge(4, 6), newEdge(6, 7)};

intq = e.length;

UnionUtil(e, W, q);


intmaxi = findMax(n, W);

System.out.printf("Maximum size of the subtree with ");
System.out.printf("even weighted nodes = %d\n", maxi);
}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
classGFG
{
staticintN = 100010;

staticclassEdge
{
intu, v;

publicEdge(intu, intv)
	{
this.u = u;
this.v = v;
	}
}


staticint []id = newint[N];
staticint []sz = newint[N];


staticintRoot(intidx)
{
inti = idx;

while(i != id[i])
	{
id[i] = id[id[i]];
i = id[i];
	}
returni;
}


staticvoidUnion(inta, intb)
{
inti = Root(a), j = Root(b);

if (i != j)
	{
if(sz[i] >= sz[j])
 {
id[j] = i;
sz[i] += sz[j];
sz[j] = 0;
 }
else
 {
id[i] = j;
sz[j] += sz[i];
sz[i] = 0;
 }
	}
}


staticvoidUnionUtil(Edgee[], intW[], intq)
{
for(inti = 0; i < q; i++)
	{

intu, v;
u = e[i].u;
v = e[i].v;


u--;
v--;


if(W[u] % 2 == 0 && W[v] % 2 == 0)
Union(u, v);
	}
}


staticintfindMax(intn, intW[])
{
intmaxi = 0;
for(inti = 1; i < n; i++)
if(W[i] % 2 == 0)
maxi = Math.max(maxi, sz[i]);

returnmaxi;
}


publicstaticvoidmain(String[] args)
{


intW[] = {1, 2, 6, 4, 2, 0, 3};


intn = W.length;


for(inti = 0; i < n; i++)
	{
id[i] = i;
sz[i] = 1;
	}

Edgee[] = {newEdge(1, 2), newEdge(1, 3),
newEdge(2, 4), newEdge(2, 5),
newEdge(4, 6), newEdge(6, 7)};

intq = e.length;

UnionUtil(e, W, q);


intmaxi = findMax(n, W);

System.out.printf("Maximum size of the subtree with ");
System.out.printf("even weighted nodes = %d\n", maxi);
}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
classGFG
{
staticintN = 100010;

staticclassEdge
{
intu, v;

publicEdge(intu, intv)
	{
this.u = u;
this.v = v;
	}
}


staticint []id = newint[N];
staticint []sz = newint[N];


staticintRoot(intidx)
{
inti = idx;

while(i != id[i])
	{
id[i] = id[id[i]];
i = id[i];
	}
returni;
}


staticvoidUnion(inta, intb)
{
inti = Root(a), j = Root(b);

if (i != j)
	{
if(sz[i] >= sz[j])
 {
id[j] = i;
sz[i] += sz[j];
sz[j] = 0;
 }
else
 {
id[i] = j;
sz[j] += sz[i];
sz[i] = 0;
 }
	}
}


staticvoidUnionUtil(Edgee[], intW[], intq)
{
for(inti = 0; i < q; i++)
	{

intu, v;
u = e[i].u;
v = e[i].v;


u--;
v--;


if(W[u] % 2 == 0 && W[v] % 2 == 0)
Union(u, v);
	}
}


staticintfindMax(intn, intW[])
{
intmaxi = 0;
for(inti = 1; i < n; i++)
if(W[i] % 2 == 0)
maxi = Math.max(maxi, sz[i]);

returnmaxi;
}


publicstaticvoidmain(String[] args)
{


intW[] = {1, 2, 6, 4, 2, 0, 3};


intn = W.length;


for(inti = 0; i < n; i++)
	{
id[i] = i;
sz[i] = 1;
	}

Edgee[] = {newEdge(1, 2), newEdge(1, 3),
newEdge(2, 4), newEdge(2, 5),
newEdge(4, 6), newEdge(6, 7)};

intq = e.length;

UnionUtil(e, W, q);


intmaxi = findMax(n, W);

System.out.printf("Maximum size of the subtree with ");
System.out.printf("even weighted nodes = %d\n", maxi);
}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
classGFG
{
staticintN = 100010;

staticclassEdge
{
intu, v;

publicEdge(intu, intv)
	{
this.u = u;
this.v = v;
	}
}


staticint []id = newint[N];
staticint []sz = newint[N];


staticintRoot(intidx)
{
inti = idx;

while(i != id[i])
	{
id[i] = id[id[i]];
i = id[i];
	}
returni;
}


staticvoidUnion(inta, intb)
{
inti = Root(a), j = Root(b);

if (i != j)
	{
if(sz[i] >= sz[j])
 {
id[j] = i;
sz[i] += sz[j];
sz[j] = 0;
 }
else
 {
id[i] = j;
sz[j] += sz[i];
sz[i] = 0;
 }
	}
}


staticvoidUnionUtil(Edgee[], intW[], intq)
{
for(inti = 0; i < q; i++)
	{

intu, v;
u = e[i].u;
v = e[i].v;


u--;
v--;


if(W[u] % 2 == 0 && W[v] % 2 == 0)
Union(u, v);
	}
}


staticintfindMax(intn, intW[])
{
intmaxi = 0;
for(inti = 1; i < n; i++)
if(W[i] % 2 == 0)
maxi = Math.max(maxi, sz[i]);

returnmaxi;
}


publicstaticvoidmain(String[] args)
{


intW[] = {1, 2, 6, 4, 2, 0, 3};


intn = W.length;


for(inti = 0; i < n; i++)
	{
id[i] = i;
sz[i] = 1;
	}

Edgee[] = {newEdge(1, 2), newEdge(1, 3),
newEdge(2, 4), newEdge(2, 5),
newEdge(4, 6), newEdge(6, 7)};

intq = e.length;

UnionUtil(e, W, q);


intmaxi = findMax(n, W);

System.out.printf("Maximum size of the subtree with ");
System.out.printf("even weighted nodes = %d\n", maxi);
}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
classGFG
{
staticintN = 100010;

staticclassEdge
{
intu, v;

publicEdge(intu, intv)
	{
this.u = u;
this.v = v;
	}
}


staticint []id = newint[N];
staticint []sz = newint[N];


staticintRoot(intidx)
{
inti = idx;

while(i != id[i])
	{
id[i] = id[id[i]];
i = id[i];
	}
returni;
}


staticvoidUnion(inta, intb)
{
inti = Root(a), j = Root(b);

if (i != j)
	{
if(sz[i] >= sz[j])
 {
id[j] = i;
sz[i] += sz[j];
sz[j] = 0;
 }
else
 {
id[i] = j;
sz[j] += sz[i];
sz[i] = 0;
 }
	}
}


staticvoidUnionUtil(Edgee[], intW[], intq)
{
for(inti = 0; i < q; i++)
	{

intu, v;
u = e[i].u;
v = e[i].v;


u--;
v--;


if(W[u] % 2 == 0 && W[v] % 2 == 0)
Union(u, v);
	}
}


staticintfindMax(intn, intW[])
{
intmaxi = 0;
for(inti = 1; i < n; i++)
if(W[i] % 2 == 0)
maxi = Math.max(maxi, sz[i]);

returnmaxi;
}


publicstaticvoidmain(String[] args)
{


intW[] = {1, 2, 6, 4, 2, 0, 3};


intn = W.length;


for(inti = 0; i < n; i++)
	{
id[i] = i;
sz[i] = 1;
	}

Edgee[] = {newEdge(1, 2), newEdge(1, 3),
newEdge(2, 4), newEdge(2, 5),
newEdge(4, 6), newEdge(6, 7)};

intq = e.length;

UnionUtil(e, W, q);


intmaxi = findMax(n, W);

System.out.printf("Maximum size of the subtree with ");
System.out.printf("even weighted nodes = %d\n", maxi);
}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
classGFG
{
staticintN = 100010;

staticclassEdge
{
intu, v;

publicEdge(intu, intv)
	{
this.u = u;
this.v = v;
	}
}


staticint []id = newint[N];
staticint []sz = newint[N];


staticintRoot(intidx)
{
inti = idx;

while(i != id[i])
	{
id[i] = id[id[i]];
i = id[i];
	}
returni;
}


staticvoidUnion(inta, intb)
{
inti = Root(a), j = Root(b);

if (i != j)
	{
if(sz[i] >= sz[j])
 {
id[j] = i;
sz[i] += sz[j];
sz[j] = 0;
 }
else
 {
id[i] = j;
sz[j] += sz[i];
sz[i] = 0;
 }
	}
}


staticvoidUnionUtil(Edgee[], intW[], intq)
{
for(inti = 0; i < q; i++)
	{

intu, v;
u = e[i].u;
v = e[i].v;


u--;
v--;


if(W[u] % 2 == 0 && W[v] % 2 == 0)
Union(u, v);
	}
}


staticintfindMax(intn, intW[])
{
intmaxi = 0;
for(inti = 1; i < n; i++)
if(W[i] % 2 == 0)
maxi = Math.max(maxi, sz[i]);

returnmaxi;
}


publicstaticvoidmain(String[] args)
{


intW[] = {1, 2, 6, 4, 2, 0, 3};


intn = W.length;


for(inti = 0; i < n; i++)
	{
id[i] = i;
sz[i] = 1;
	}

Edgee[] = {newEdge(1, 2), newEdge(1, 3),
newEdge(2, 4), newEdge(2, 5),
newEdge(4, 6), newEdge(6, 7)};

intq = e.length;

UnionUtil(e, W, q);


intmaxi = findMax(n, W);

System.out.printf("Maximum size of the subtree with ");
System.out.printf("even weighted nodes = %d\n", maxi);
}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
classGFG
{
staticintN = 100010;

staticclassEdge
{
intu, v;

publicEdge(intu, intv)
	{
this.u = u;
this.v = v;
	}
}


staticint []id = newint[N];
staticint []sz = newint[N];


staticintRoot(intidx)
{
inti = idx;

while(i != id[i])
	{
id[i] = id[id[i]];
i = id[i];
	}
returni;
}


staticvoidUnion(inta, intb)
{
inti = Root(a), j = Root(b);

if (i != j)
	{
if(sz[i] >= sz[j])
 {
id[j] = i;
sz[i] += sz[j];
sz[j] = 0;
 }
else
 {
id[i] = j;
sz[j] += sz[i];
sz[i] = 0;
 }
	}
}


staticvoidUnionUtil(Edgee[], intW[], intq)
{
for(inti = 0; i < q; i++)
	{

intu, v;
u = e[i].u;
v = e[i].v;


u--;
v--;


if(W[u] % 2 == 0 && W[v] % 2 == 0)
Union(u, v);
	}
}


staticintfindMax(intn, intW[])
{
intmaxi = 0;
for(inti = 1; i < n; i++)
if(W[i] % 2 == 0)
maxi = Math.max(maxi, sz[i]);

returnmaxi;
}


publicstaticvoidmain(String[] args)
{


intW[] = {1, 2, 6, 4, 2, 0, 3};


intn = W.length;


for(inti = 0; i < n; i++)
	{
id[i] = i;
sz[i] = 1;
	}

Edgee[] = {newEdge(1, 2), newEdge(1, 3),
newEdge(2, 4), newEdge(2, 5),
newEdge(4, 6), newEdge(6, 7)};

intq = e.length;

UnionUtil(e, W, q);


intmaxi = findMax(n, W);

System.out.printf("Maximum size of the subtree with ");
System.out.printf("even weighted nodes = %d\n", maxi);
}
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
classGFG
{
staticintN = 100010;

staticclassEdge
{
intu, v;

publicEdge(intu, intv)
	{
this.u = u;
this.v = v;
	}
}


staticint []id = newint[N];
staticint []sz = newint[N];


staticintRoot(intidx)
{
inti = idx;

while(i != id[i])
	{
id[i] = id[id[i]];
i = id[i];
	}
returni;
}


staticvoidUnion(inta, intb)
{
inti = Root(a), j = Root(b);

if (i != j)
	{
if(sz[i] >= sz[j])
 {
id[j] = i;
sz[i] += sz[j];
sz[j] = 0;
 }
else
 {
id[i] = j;
sz[j] += sz[i];
sz[i] = 0;
 }
	}
}


staticvoidUnionUtil(Edgee[], intW[], intq)
{
for(inti = 0; i < q; i++)
	{

intu, v;
u = e[i].u;
v = e[i].v;


u--;
v--;


if(W[u] % 2 == 0 && W[v] % 2 == 0)
Union(u, v);
	}
}


staticintfindMax(intn, intW[])
{
intmaxi = 0;
for(inti = 1; i < n; i++)
if(W[i] % 2 == 0)
maxi = Math.max(maxi, sz[i]);

returnmaxi;
}


publicstaticvoidmain(String[] args)
{


intW[] = {1, 2, 6, 4, 2, 0, 3};


intn = W.length;


for(inti = 0; i < n; i++)
	{
id[i] = i;
sz[i] = 1;
	}

Edgee[] = {newEdge(1, 2), newEdge(1, 3),
newEdge(2, 4), newEdge(2, 5),
newEdge(4, 6), newEdge(6, 7)};

intq = e.length;

UnionUtil(e, W, q);


intmaxi = findMax(n, W);

System.out.printf("Maximum size of the subtree with ");
System.out.printf("even weighted nodes = %d\n", maxi);
}
}