并查集

 

#include <stdio.h>
#include <stdlib.h>

#define VECTICES 6


void initialise(int parent[])
{
	int i;
	for(i=0; i<VECTICES; i++)
	{
		parent[i] = -1;
	}
}

int find_root(int x, int parent[]){
	int x_root = x;
	while(parent[x_root] != -1){
	x_root = parent[x_root];	
	}
	return x_root;
}

//cycle 1 ok 0 false
int union_vertices(int x, int y, int parent[]){
	int x_root = find_root(x, parent);
	int y_root = find_root(y, parent);
	if(x_root == y_root){
		return 0;	
	}else{
		parent[x_root] = y_root;
		return 1;	
	}

	
}
int main()
{

	int parent[VECTICES] = {0};
	int edges[6][2] = {
	{0,1},{1,2},{1,3},{2,4},{3,4},{2,5}	
	};
	initialise(parent);
	int i;
	for(i=0; i<6; i++)
	{
		int x = edges[i][0];
		int y = edges[i][1];
		if(union_vertices(x,y,parent) == 0){
			printf("cycle detected!\n");
			exit(0);		
		}
	}
	printf("no cycle!\n");
	return 0;
}