{"id":21590572,"url":"https://github.com/anishlearnstocode/graph-theory-lab","last_synced_at":"2025-09-17T11:55:17.499Z","repository":{"id":98361404,"uuid":"289199214","full_name":"anishLearnsToCode/graph-theory-lab","owner":"anishLearnsToCode","description":"Graph Theory Lab Practicals @ Delhi Technological University 🎓","archived":false,"fork":false,"pushed_at":"2020-11-19T07:28:37.000Z","size":18772,"stargazers_count":4,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-04-10T22:11:16.790Z","etag":null,"topics":["dtu","graph-theory","lab","practical"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/anishLearnsToCode.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2020-08-21T06:49:06.000Z","updated_at":"2022-09-06T09:07:07.000Z","dependencies_parsed_at":"2023-07-10T14:15:19.478Z","dependency_job_id":null,"html_url":"https://github.com/anishLearnsToCode/graph-theory-lab","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/anishLearnsToCode/graph-theory-lab","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anishLearnsToCode%2Fgraph-theory-lab","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anishLearnsToCode%2Fgraph-theory-lab/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anishLearnsToCode%2Fgraph-theory-lab/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anishLearnsToCode%2Fgraph-theory-lab/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/anishLearnsToCode","download_url":"https://codeload.github.com/anishLearnsToCode/graph-theory-lab/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anishLearnsToCode%2Fgraph-theory-lab/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":275591115,"owners_count":25492265,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-09-17T02:00:09.119Z","response_time":84,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["dtu","graph-theory","lab","practical"],"created_at":"2024-11-24T16:19:12.802Z","updated_at":"2025-09-17T11:55:17.495Z","avatar_url":"https://github.com/anishLearnsToCode.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Graph Theory (MC-405) Lab Practicals\n__Anish Sachdeva (DTU/2K16/MC/013)__\n\n⭐ [Project Report](assets/graph-theory-lab-file.pdf)\n\n\n| No. | Experiment Name | Date | Solution |\n|-----|-----------------|------|:----:|\n| 1 | Program to find the number of vertices, even vertices, odd vertices and number of edges in a Graph. | 20th August 2020 | [![Java](https://img.icons8.com/color/35/000000/java-coffee-cup-logo.png)](src/Lab1.java) [![cpp](https://img.icons8.com/color/30/000000/c-plus-plus-logo.png)](cpp/lab1.cpp) |  \n| 2 | Program to Find Union, Intersection and ring-sum of 2 graphs. | 27th September 2020 | [![Java](https://img.icons8.com/color/35/000000/java-coffee-cup-logo.png)](src/Lab2.java) [![cpp](https://img.icons8.com/color/30/000000/c-plus-plus-logo.png)](cpp/lab2.cpp)|\n| 3 | Program to Find Minimum Spanning tree Using Prim's Algorithm | 3d September 2020 | [![Java](https://img.icons8.com/color/35/000000/java-coffee-cup-logo.png)](src/Lab3.java) [![cpp](https://img.icons8.com/color/30/000000/c-plus-plus-logo.png)](cpp/lab3.cpp)|\n| 4 | Program to Find Minimum Spanning tree Using Kruskal's Algorithm | 17th September 2020| [![Java](https://img.icons8.com/color/35/000000/java-coffee-cup-logo.png)](src/Lab4.java) [![cpp](https://img.icons8.com/color/30/000000/c-plus-plus-logo.png)](cpp/lab4.cpp) |\n| 5 | Program to find Shortest Path between 2 Vertices using Dijkstra Algorithm | 21st September 2020 | [![Java](https://img.icons8.com/color/35/000000/java-coffee-cup-logo.png)](src/Lab5.java) [![cpp](https://img.icons8.com/color/30/000000/c-plus-plus-logo.png)](cpp/lab5.cpp) |\n| 6 | Program to find Shortest Path between every pair of vertices in a graph using Floyd-Warshall's Algorithm. | 22nd October 2020 | [![Java](https://img.icons8.com/color/35/000000/java-coffee-cup-logo.png)](src/Lab6.java) [![cpp](https://img.icons8.com/color/30/000000/c-plus-plus-logo.png)](cpp/lab6.cpp) |\n| 7 | Program to find Shortest Path between 2 Vertices using Bellman Ford's Algorithm. | 22nd October 2020 | [![Java](https://img.icons8.com/color/35/000000/java-coffee-cup-logo.png)](src/Lab7.java) [![cpp](https://img.icons8.com/color/30/000000/c-plus-plus-logo.png)](cpp/lab7.cpp) |\n| 8 | Program For finding maximum Matching for bipartite graph | 29th October 2020 | [![Java](https://img.icons8.com/color/35/000000/java-coffee-cup-logo.png)](src/Lab8.java) [![cpp](https://img.icons8.com/color/30/000000/c-plus-plus-logo.png)](cpp/lab8.cpp) |\n| 9 | Program For finding maximum Matching for General Path | 29th October 2020 | [![cpp](https://img.icons8.com/color/30/000000/c-plus-plus-logo.png)](cpp/lab9.cpp) |\n| 10 | Program to find maximum flow from source node to sink node using Ford-Fulkerson Algorithm | 29th October 2020 | [![Java](https://img.icons8.com/color/35/000000/java-coffee-cup-logo.png)](src/Lab10.java) [![cpp](https://img.icons8.com/color/30/000000/c-plus-plus-logo.png)](cpp/lab10.cpp) | \n\nThe above programs only contain driver code and main logic has been encapsulated inside the\nGraph Classes, namely:\n\n| Graph Class | Code |\n|-------------|------|\n| Un-directed Unweighted Graph | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/UnDirectedGraph.java) |\n| Un-Directed Weighted Graph | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/UnDirectedWeightedGraph.java) | \n| Directed Graph | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/DirectedGraph.java) |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanishlearnstocode%2Fgraph-theory-lab","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fanishlearnstocode%2Fgraph-theory-lab","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanishlearnstocode%2Fgraph-theory-lab/lists"}