Docsity
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

QuickFindUf: A Connected Component Algorithm, Study notes of Algorithms and Programming

Vellore Institute of TechnologyAlgorithms and Programming

The implementation of the quickfinduf class, a data structure used to determine if two elements are connected in a graph or an undirected graph. The class includes a constructor, a connected method, and a union method.

Typology: Study notes

2014/2015

Uploaded on 03/03/2015

Ayush.Agrawal
Ayush.Agrawal 🇮🇳

8 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
class QuickFindUf
{
private int[] id;
QuickFindUf(int n)
{
id=new int[n];
for(int i=0;i<n;i++)
id[i]=i;
}
public boolean connected(int a,int b)
{
return (id[a]==id[b]);
}
public void union(int a,int b)
{
int ida=id[a];
int idb=id[b];
int i;
for(i=0;i<id.length;i++)
{
if(id[i]==ida)
id[i]=idb;
}
}
}

Partial preview of the text

Download QuickFindUf: A Connected Component Algorithm and more Study notes Algorithms and Programming in PDF only on Docsity!

class QuickFindUf { private int[] id;

QuickFindUf(int n) { id=new int[n]; for(int i=0;i<n;i++) id[i]=i; }

public boolean connected(int a,int b) { return (id[a]==id[b]); }

public void union(int a,int b) { int ida=id[a]; int idb=id[b];

int i;

for(i=0;i<id.length;i++) { if(id[i]==ida) id[i]=idb; } } }