Commit ccdeb3c

committed

Added Code

1 parent e56ed5e commit ccdeb3cCopy full SHA for ccdeb3c

File tree

-3

lines changed

-3

lines changed

Lines changed: 2 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -68,9 +68,10 @@ public void dfs_helper(int node, int[] visited, Stack<Integer> st) {`
`68`	`68`	`for (int c : this.graph.get(node)) {`
`69`	`69`	`if (visited[c] == 0) {`
`70`	`70`	`dfs_helper(c, visited, st);`
`71`		`- st.add(c);`
	`71`	`+`
`72`	`72`	`}`
`73`	`73`	`}`
	`74`	`+ st.add(node);`
`74`	`75`	`}`
`75`	`76`
`76`	`77`	`}`

Lines changed: 5 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -23,7 +23,7 @@ public int get_superparent(int x) {`
`23`	`23`
`24`	`24`	`if(this.parent[x]==x)`
`25`	`25`	`return x;`
`26`		`-`
	`26`	`+ // Path Compression`
`27`	`27`	`else return parent[x] = get_superparent(parent[x]);`
`28`	`28`	`}`
`29`	`29`
`@@ -33,6 +33,7 @@ public void union(int x, int y) {`
`33`	`33`	`if(superparent_x != superparent_y) {`
`34`	`34`	`this.parent[superparent_x] = superparent_y;`
`35`	`35`	`this.noOfComponents-=1;`
	`36`	`+ // x is connected to y, so size of SP of x = 0 and size of SP y += size(SP x)`
`36`	`37`	`this.size[superparent_y] += this.size[superparent_x];`
`37`	`38`	`this.size[superparent_x] = 0;`
`38`	`39`	`}`
`@@ -68,7 +69,9 @@ public static void main(String[] args) {`
`68`	`69`
`69`	`70`	`int ans = 0;`
`70`	`71`	`for(int i=0;i<N; i++) {`
`71`		`- int superparent_i = g.get_superparent(i);`
	`72`	`+ int superparent_i = g.get_superparent(i);`
	`73`	`+ // g.size[superparent_i] gives size of that connected comp, so n- g.size[superparent_i] will give no of nodes`
	`74`	`+ // which are in diff comp.`
`72`	`75`	`ans+=(N-g.size[superparent_i]);`
`73`	`76`	`}`
`74`	`77`	`//g.display_arr(g.size);`

Comments

(0)