This is a C Program to creat a balanced binary search tree. AVL tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes. Here is source code of the C Program to Create a Balanced Binary Tree of the … Read more
This is a C Program to check whether points are colinear or not. Here is source code of the C Program to Check Whether a Given Points are Colinear or Not. The C program is successfully compiled and run on a Linux system. The program output is also shown below. #include <string.h>#include <stdio.h>#include <stdlib.h> const int … Read more
This is a C Program to solve linear equation in one variable. Here is source code of the C Program to Solve any Linear Equation in One Variable. The C program is successfully compiled and run on a Linux system. The program output is also shown below. #include <stdio.h>#include <string.h>float solve_for_y(float a, float b, float … Read more
This is a C Program to implement AVL tree. An AVL (Adelson-Velskii and Landis) tree is a self-height balance tree. These trees are binary search trees in which the height of two siblings are not allowed to differ by more than one. Here is source code of the C Program to Print the Kind of … Read more
Bellman Ford Algorithm in C is used in the graph data structure to find the shortest route from a single source to every other node in the Graph. There are many more uses of the Bellman ford algorithm other than finding the shortest route/path such as Bellman-Ford can detect the presence of a negative-weight cycle … Read more
This is a C Program to find Transitive Closure. Floyd–Warshall algorithm is a graph analysis algorithm for finding shortest paths in a weighted graph with positive or negative edge weights but with no negative cycles and also for finding transitive closure of a relation R. Here is source code of the C Program to Construct … Read more
This is a C Program to find vertex connectivity of a graph. A vertex in an undirected connected graph is an articulation point if and only if removing it disconnects the graph. Here is source code of the C Program to Find the Vertex Connectivity of a Graph. The C program is successfully compiled and … Read more
This is a C Program to perform Topological Sorting. Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices such that for every directed edge pq, vertex p comes before q in the ordering. Topological Sorting for a graph is not possible if the graph is not a DAG. Here is source … Read more
This is a C Program to find Dijkstra algorithm. Dijkstra’s algorithm is very similar to Prim’s algorithm for minimum spanning tree. Like Prim’s MST, we generate a SPT (shortest path tree) with given source as root. We maintain two sets, one set contains vertices included in shortest path tree, other set includes vertices not yet … Read more
This is a C Program to solve a matching problem. Given N men and N women, where each person has ranked all members of the opposite sex in order of preference, marry the men and women together such that there are no two people of opposite sex who would both rather have each other than … Read more
