Program to Compute the transitive closure of a given directed graph using Warshall’s algorithm

//Compute the transitive closure of a given directed graph using Warshall's algorithm #include #include int a[10][10]; void main() { int i,j,k,n; clrscr(); printf("n enter the number of verticesn"); scanf("%d",&n); printf("n…

Continue ReadingProgram to Compute the transitive closure of a given directed graph using Warshall’s algorithm

Program to Implement Recursive Binary search and Linear search

/* Implementation of recursive binary search and sequential search */ #include #include #include #include                       #define max 20 int pos; int binsearch(int,int[],int,int,int); int linsearch(int,int[],int); void main() { int ch=1; double t;…

Continue ReadingProgram to Implement Recursive Binary search and Linear search