Ankur Gupta ankurgupta255

## Kruskal's algorithm implementation
#include<bits/stdc++.h>
using namespace std;

struct node {
	int parent;
	int rank;
};
struct Edge {
	int src;
	int dst;

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

#define V 6		//No of vertices

int selectMinVertex(vector<int>& value,vector<bool>& setMST)
{
	int minimum = INT_MAX;
	int vertex;
	for(int i=0;i<V;++i)

## Disjoint set UNION by RANK and Path Compression
#include<bits/stdc++.h>
using namespace std;

struct node {
	int parent;
	int rank;
};

vector<node> dsuf;
//FIND operation

## Disjoint Set (UNION & FIND)
#include<bits/stdc++.h>
using namespace std;

vector<int> dsuf;
//FIND operation
int find(int v)
{
	if(dsuf[v]==-1)
		return v;
	return find(dsuf[v]);

## README-Template.md

      
        
          
            
              
              1 file
            
          
          
            
              
              4761 forks
            
          
            
              
                
                1715 comments
              
            
          
            
              
              14098 stars
            
          
        
        
          
              
          
          
            
                PurpleBooth
                / README-Template.md
            
            
              Last active
              December 10, 2025 21:19
            
              
                A template to make good README.md
              
          
        
      
        
  
      
    Project Title

One Paragraph of project description goes here
Getting Started

These instructions will get you a copy of the project up and running on your local machine for development and testing purposes. See deployment for notes on how to deploy the project on a live system.
Prerequisites
	#include<bits/stdc++.h>
	using namespace std;

	struct node {
	int parent;
	int rank;
	};
	struct Edge {
	int src;
	int dst;
	#include<bits/stdc++.h>
	using namespace std;

	#define V 6 //No of vertices

	int selectMinVertex(vector<int>& value,vector<bool>& setMST)
	{
	int minimum = INT_MAX;
	int vertex;
	for(int i=0;i<V;++i)
	#include<bits/stdc++.h>
	using namespace std;

	vector<int> dsuf;
	//FIND operation
	int find(int v)
	{
	if(dsuf[v]==-1)
	return v;
	return find(dsuf[v]);