Coding Atharva: Graphs

Showing posts with label Graphs. Show all posts

16 Program to Print All Possible Combination of Graph Coloring with 4 colors (r,b,g,y) such that no 2 adjacent vertices can have same color

Program: /* Q8.WAP to color your graph using given 4 colors(r,g,b,y).Print all the possible combinations of colors which can...

Program: /* Dijkstra's Algorithm */ #include<iostream> #define INF INT_MAX using namespace std; class Gra...

Steps: 1) Add Edges in Ascending Order by their Weight 2) Do not Create a Cycle. If any edge is Creating a Cycle Skip that Edge Prog...

Program: /* Prims Algorithm */ #include<iostream> #define INF INT_MAX using namespace std; class Graph { int g[20...

Program: /* Spanning Tree 6 0 0 0 0 1 0 2 1 3 2 3 1 4 4 3 4 5 3 5 2 5 -1 -1 */ #include<iostream> #define INF 9999...

Program: /* Q1.WAP to implement topological sort. */ #include<iostream> using namespace std; class Graph { int **...

Program: /* Warshall's Algorithm */ #include<iostream> using namespace std; class Graph { int g[20][20]; int...

Program: /* Scan adjacency matrix of graph.Find transitive closure by using matrix multiplication. */ #include <iostre...