Anish Sachdeva (DTU/2K16/MC/013)
| No. | Experiment Name | Date | Solution |
|---|---|---|---|
| 1 | Program to find the number of vertices, even vertices, odd vertices and number of edges in a Graph. | 20th August 2020 |   |
| 2 | Program to Find Union, Intersection and ring-sum of 2 graphs. | 27th September 2020 | |
| 3 | Program to Find Minimum Spanning tree Using Prim's Algorithm | 3d September 2020 | |
| 4 | Program to Find Minimum Spanning tree Using Kruskal's Algorithm | 17th September 2020 | |
| 5 | Program to find Shortest Path between 2 Vertices using Dijkstra Algorithm | 21st September 2020 | |
| 6 | Program to find Shortest Path between every pair of vertices in a graph using Floyd-Warshall's Algorithm. | 22nd October 2020 | |
| 7 | Program to find Shortest Path between 2 Vertices using Bellman Ford's Algorithm. | 22nd October 2020 | |
| 8 | Program For finding maximum Matching for bipartite graph | 29th October 2020 | |
| 9 | Program For finding maximum Matching for General Path | 29th October 2020 | |
| 10 | Program to find maximum flow from source node to sink node using Ford-Fulkerson Algorithm | 29th October 2020 | |
The above programs only contain driver code and main logic has been encapsulated inside the Graph Classes, namely:
| Graph Class | Code |
|---|---|
| Un-directed Unweighted Graph |  |
| Un-Directed Weighted Graph | |
| Directed Graph | |