Graph Theory (MC-405) Lab Practicals

November 19, 2020 · View on GitHub

Anish Sachdeva (DTU/2K16/MC/013)

⭐ Project Report

No.Experiment NameDateSolution
1Program to find the number of vertices, even vertices, odd vertices and number of edges in a Graph.20th August 2020Java cpp
2Program to Find Union, Intersection and ring-sum of 2 graphs.27th September 2020Java cpp
3Program to Find Minimum Spanning tree Using Prim's Algorithm3d September 2020Java cpp
4Program to Find Minimum Spanning tree Using Kruskal's Algorithm17th September 2020Java cpp
5Program to find Shortest Path between 2 Vertices using Dijkstra Algorithm21st September 2020Java cpp
6Program to find Shortest Path between every pair of vertices in a graph using Floyd-Warshall's Algorithm.22nd October 2020Java cpp
7Program to find Shortest Path between 2 Vertices using Bellman Ford's Algorithm.22nd October 2020Java cpp
8Program For finding maximum Matching for bipartite graph29th October 2020Java cpp
9Program For finding maximum Matching for General Path29th October 2020cpp
10Program to find maximum flow from source node to sink node using Ford-Fulkerson Algorithm29th October 2020Java cpp

The above programs only contain driver code and main logic has been encapsulated inside the Graph Classes, namely:

Graph ClassCode
Un-directed Unweighted GraphJava
Un-Directed Weighted GraphJava
Directed GraphJava