## C Program to Find Minimum Spanning Tree using Kruskal’s Algorithm

This is a C Program to find the minimum spanning tree of the given graph. Kruskal’s algorithm is a greedy algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. It finds a subset of the edges that forms a tree that includes every vertex, where the total weight of … Read more

## C program to display all possible permutations of numbers from 1 to n using Alexander Bogomolyn’s unordered permutation algorithm

This C program implements Alexander Bogomolyn’s unordered permutation algorithm to find all permutations of numbers from 1 to n. Here is the source code of the C program to display all possible permutations of numbers from 1 to n using Alexander Bogomolyn’s unordered permutation algorithm. The C program is successfully compiled and run on a … Read more

## Inorder Traversal of a Binary Tree using Recursion in C

This is a C Program to perform inorder traversal. Time Complexity: O(n) Here is source code of the C Program to Perform Inorder Recursive Traversal of a Given Binary Tree. The C program is successfully compiled and run on a Linux system. The program output is also shown below. #include <stdio.h>#include <stdlib.h> /* A binary tree … Read more

## C Program to Find Median of Two Arrays of Different Sizes

This is a C Program to find median of elements where elements are stored in two different arrays. Here is source code of the C Program to Find Median of Elements where Elements are Stored in 2 Different Arrays. The C program is successfully compiled and run on a Linux system. The program output is … Read more

## C Program to Generate Random Partition from Given Set

This is a C Program to perform partitioning at random index and generate two sets for given set of numbers or characters Here is source code of the C Program to Generate Random Partition out of a Given Set of Numbers or Characters. The C program is successfully compiled and run on a Linux system. … Read more

## Inorder Traversal of a Binary Tree without using Recursion in C

This is a C Program to perform inorder traversal. Time Complexity: O(n) Here is source code of the C Program to Perform Inorder Non-Recursive Traversal of a Given Binary Tree. The C program is successfully compiled and run on a Linux system. The program output is also shown below. #include<stdio.h>#include<stdlib.h>#define bool int /* A binary tree … Read more

## C Program to Check the Connectivity of Graph Using DFS

This is a C Program to check the connectivity of directed graph using DFS. Depth-first search is a systematic way to find all the vertices reachable from a source vertex, s. Historically, depth-first was first stated formally hundreds of years ago as a method for traversing mazes. Like breadth-first search, DFS traverse a connected component … Read more

## C Program to Check the Connectivity of Graph Using BFS

This is a C Program to check the connectivity of directed graph using BFS. Breadth-first search is a way to find all the vertices reachable from the a given source vertex, s. Like depth first search, BFS traverse a connected component of a given graph and defines a spanning tree. Intuitively, the basic idea of … Read more

## C Program to Check if a Graph is Strongly Connected or Not

This is a C Program to find the connected components of the undirected graph. This can be done using depth first search. If the number of connected components is greater than one graph is weakly connected else its strongly connected. Here is source code of the C Program to Check Whether a Graph is Strongly … Read more 