Skip to content

Added UnionFind algorithm #215

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
EshraqIbrahim wants to merge 2 commits into from
Closed

Added UnionFind algorithm #215

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
34714e1
Adding union find
EshraqIbrahim Oct 17, 2017
a84a086
Rename unionFind to unionFind.java
EshraqIbrahim Oct 17, 2017
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
38 changes: 38 additions & 0 deletions Others/unionFind.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,38 @@
//Eshraq Ibrahim 17/10/2017
//union find algorithm purpose is to find if there is a path between 2 objects or not

public class unionFind {
private int id[];

// constructor takes number of objects
public unionFind(int n) {
id = new int[n];
// set id of each object to itself
for (int i = 0; i < n; i++) {
id[i] = i;
}
}

/**
* connect 2 objects together
*/
public void union(final int n, final int m) {
int nid = id[n];
int mid = id[m];

for (int i = 0; i < id.length; i++) {
if (id[i] == nid) {
id[i] = mid;
}
}
}

/**
* Find whether there is a path between these 2 Objects
*/
public boolean intersected(final int n, final int m) {
// checks if the 2 objects have the same id
return (id[n] == id[m]);
}

}