https://github.com/anishlearnstocode/graph-theory-lab
Graph Theory Lab Practicals @ Delhi Technological University 🎓
https://github.com/anishlearnstocode/graph-theory-lab
dtu graph-theory lab practical
Last synced: 5 months ago
JSON representation
Graph Theory Lab Practicals @ Delhi Technological University 🎓
- Host: GitHub
- URL: https://github.com/anishlearnstocode/graph-theory-lab
- Owner: anishLearnsToCode
- License: mit
- Created: 2020-08-21T06:49:06.000Z (over 5 years ago)
- Default Branch: master
- Last Pushed: 2020-11-19T07:28:37.000Z (about 5 years ago)
- Last Synced: 2025-04-10T22:11:16.790Z (10 months ago)
- Topics: dtu, graph-theory, lab, practical
- Language: Java
- Homepage:
- Size: 17.9 MB
- Stars: 4
- Watchers: 2
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Graph Theory (MC-405) Lab Practicals
__Anish Sachdeva (DTU/2K16/MC/013)__
⭐ [Project Report](assets/graph-theory-lab-file.pdf)
| 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 | [](src/Lab1.java) [](cpp/lab1.cpp) |
| 2 | Program to Find Union, Intersection and ring-sum of 2 graphs. | 27th September 2020 | [](src/Lab2.java) [](cpp/lab2.cpp)|
| 3 | Program to Find Minimum Spanning tree Using Prim's Algorithm | 3d September 2020 | [](src/Lab3.java) [](cpp/lab3.cpp)|
| 4 | Program to Find Minimum Spanning tree Using Kruskal's Algorithm | 17th September 2020| [](src/Lab4.java) [](cpp/lab4.cpp) |
| 5 | Program to find Shortest Path between 2 Vertices using Dijkstra Algorithm | 21st September 2020 | [](src/Lab5.java) [](cpp/lab5.cpp) |
| 6 | Program to find Shortest Path between every pair of vertices in a graph using Floyd-Warshall's Algorithm. | 22nd October 2020 | [](src/Lab6.java) [](cpp/lab6.cpp) |
| 7 | Program to find Shortest Path between 2 Vertices using Bellman Ford's Algorithm. | 22nd October 2020 | [](src/Lab7.java) [](cpp/lab7.cpp) |
| 8 | Program For finding maximum Matching for bipartite graph | 29th October 2020 | [](src/Lab8.java) [](cpp/lab8.cpp) |
| 9 | Program For finding maximum Matching for General Path | 29th October 2020 | [](cpp/lab9.cpp) |
| 10 | Program to find maximum flow from source node to sink node using Ford-Fulkerson Algorithm | 29th October 2020 | [](src/Lab10.java) [](cpp/lab10.cpp) |
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 | [](src/UnDirectedGraph.java) |
| Un-Directed Weighted Graph | [](src/UnDirectedWeightedGraph.java) |
| Directed Graph | [](src/DirectedGraph.java) |