#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
struct Edge {
int src, dest, weight;
};
struct Subset {
int parent;
int rank;
};
struct Graph {
int V, E;
struct Edge* edge;
};
struct Graph* createGraph(int V, int E) {
struct Graph* graph = (struct Graph*)malloc(sizeof(struct Graph));
graph->V = V;
graph->E = E;
graph->edge = (struct Edge*)malloc(E * sizeof(struct Edge));
return graph;
}
int find(struct Subset subsets[], int i) {
if (subsets[i].parent != i)
subsets[i].parent = find(subsets, subsets[i].parent);
return subsets[i].parent;
}
void Union(struct Subset subsets[], int x, int y) {
int xroot = find(subsets, x);
int yroot = find(subsets, y);
if (subsets[xroot].rank < subsets[yroot].rank)
subsets[xroot].parent = yroot;
else if (subsets[xroot].rank > subsets[yroot].rank)
subsets[yroot].parent = xroot;
else {
subsets[yroot].parent = xroot;
subsets[xroot].rank++;
}
}
int myComp(const void* a, const void* b) {
struct Edge* a1 = (struct Edge*)a;
struct Edge* b1 = (struct Edge*)b;
return a1->weight > b1->weight;
}
// Function to construct MST using Kruskal's algorithm
void KruskalMST(struct Graph* graph) {
int V = graph->V;
struct Edge result[V]; // This will store the resultant MST
int e = 0; // Index variable, used for result[]
int i = 0; // Index variable, used for sorted edges
qsort(graph->edge, graph->E, sizeof(graph->edge[0]), myComp);
struct Subset* subsets = (struct Subset*)malloc(V * sizeof(struct Subset));
for (int v = 0; v < V; v++) {
subsets[v].parent = v;
subsets[v].rank = 0;
}
while (e < V - 1 && i < graph->E) {
struct Edge next_edge = graph->edge[i++];
int x = find(subsets, next_edge.src);
int y = find(subsets, next_edge.dest);
if (x != y) {
result[e++] = next_edge;
Union(subsets, x, y);
}
}
// Print the MST
printf("Minimum Spanning Tree using Kruskal's algorithm:\n");
for (i = 0; i < e; ++i)
printf("%d - %d : %d\n", result[i].src, result[i].dest, result[i].weight);
free(subsets);
}
// Function to add an edge to the graph
void addEdge(struct Graph* graph, int src, int dest, int weight, int* edgeIndex) {
graph->edge[*edgeIndex].src = src;
graph->edge[*edgeIndex].dest = dest;
graph->edge[*edgeIndex].weight = weight;
(*edgeIndex)++;
}
// Function to print the adjacency list representation of graph
void printAdjList(struct Graph* graph) {
printf("Adjacency List:\n");
for (int i = 0; i < graph->V; i++) {
printf("Vertex %d: ", i);
for (int j = 0; j < graph->E; j++) {
if (graph->edge[j].src == i)
printf("(%d, %d) ", graph->edge[j].dest, graph->edge[j].weight);
else if (graph->edge[j].dest == i)
printf("(%d, %d) ", graph->edge[j].src, graph->edge[j].weight);
}
printf("\n");
}
}
int main() {
int V, E;
printf("Enter the number of vertices: ");
scanf("%d", &V);
printf("Enter the number of edges: ");
scanf("%d", &E);
struct Graph* graph = createGraph(V, E);
printf("Enter edges and their weights (src dest weight):\n");
int edgeIndex = 0;
for (int i = 0; i < E; i++) {
int src, dest, weight;
scanf("%d %d %d", &src, &dest, &weight);
addEdge(graph, src, dest, weight, &edgeIndex);
}
printAdjList(graph);
KruskalMST(graph);
free(graph->edge);
free(graph);
return 0;
}
Write, Run & Share C Language code online using OneCompiler's C online compiler for free. It's one of the robust, feature-rich online compilers for C language, running the latest C version which is C18. Getting started with the OneCompiler's C editor is really simple and pretty fast. The editor shows sample boilerplate code when you choose language as 'C' and start coding!
OneCompiler's C online editor supports stdin and users can give inputs to programs using the STDIN textbox under the I/O tab. Following is a sample C program which takes name as input and print your name with hello.
#include <stdio.h>
int main()
{
char name[50];
printf("Enter name:");
scanf("%s", name);
printf("Hello %s \n" , name );
return 0;
}
C language is one of the most popular general-purpose programming language developed by Dennis Ritchie at Bell laboratories for UNIX operating system. The initial release of C Language was in the year 1972. Most of the desktop operating systems are written in C Language.
When ever you want to perform a set of operations based on a condition if-else is used.
if(conditional-expression) {
// code
} else {
// code
}
You can also use if-else for nested Ifs and if-else-if ladder when multiple conditions are to be performed on a single variable.
Switch is an alternative to if-else-if ladder.
switch(conditional-expression) {
case value1:
// code
break; // optional
case value2:
// code
break; // optional
...
default:
// code to be executed when all the above cases are not matched;
}
For loop is used to iterate a set of statements based on a condition.
for(Initialization; Condition; Increment/decrement){
// code
}
While is also used to iterate a set of statements based on a condition. Usually while is preferred when number of iterations are not known in advance.
while(condition) {
// code
}
Do-while is also used to iterate a set of statements based on a condition. It is mostly used when you need to execute the statements atleast once.
do {
// code
} while (condition);
Array is a collection of similar data which is stored in continuous memory addresses. Array values can be fetched using index. Index starts from 0 to size-1.
data-type array-name[size];
data-type array-name[size][size];
Function is a sub-routine which contains set of statements. Usually functions are written when multiple calls are required to same set of statements which increases re-usuability and modularity.
Two types of functions are present in C
Library functions are the in-built functions which are declared in header files like printf(),scanf(),puts(),gets() etc.,
User defined functions are the ones which are written by the programmer based on the requirement.
return_type function_name(parameters);
function_name (parameters)
return_type function_name(parameters) {
//code
}