**Complete the code of the attached file disjoint-set_incomplete.cpp. #Code will be C++   ***disjoint-set_incomplete.cpp:   #include using namespace std; /// Final task: implement path compression and union by rank void make_set(int p[], int x){ p[x] = x; cout << "making a one-element set of "<

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Topic Video
Question

**Complete the code of the attached file disjoint-set_incomplete.cpp.

#Code will be C++

 

***disjoint-set_incomplete.cpp:

 

#include<bits/stdc++.h>
using namespace std;

/// Final task: implement path compression and union by rank
void make_set(int p[], int x){
p[x] = x;
cout << "making a one-element set of "<<x<< endl;
}

int find_set(int p[], int x){
if (x!=p[x])
return find_set(p, p[x]);
return p[x];
}

void _union(int p[], int x, int y){
int a = find_set(p, x);
int b = find_set(p, y);
p[a] = b;
cout << "union "<<a << " and "<<b<< endl;
}

int main(){


int N;
/// take N input from user

/// create the parent array for a disjoint set of N elements
int p[N];
for (int i=0;i<N;i++){
make_set(p, i);
}

while(1){
/// take an integer "option" as input.
int option;


/// if "option" is 1, take another integer x as input,
/// check if x is an element of the disjoint set or not, and
/// if it is then print the root/representative-element of x
if (option==1){

}

/// if "option" is 2, take integers x and y as input,
/// check if x and y are elements of the disjoint set or not, and
/// if they are check if they belong to the same set or not
else if (option==2){


}

/// if "option" is 3, take integers x and y as input,
/// check if x and y are elements of the disjoint set or not, and
/// if they are then union them
else if (option==3){

}

else {
return 0;
}
}

}

Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Instruction Format
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education