Graph utilities

A C++ Class which contains various graph related algorithms (Ex: BFS, DFS, Kruskal, Edmonds-Karp) that is based on concepts of Data Structures, Algorithms and Object-Oriented Programming.

Task 1

Solved problems:

• BFS (100p)
• DFS (100p)
• Biconnected Components (100p)
• Strongly Connected Components (100p)
• Havel Hakimi using sort(); function to sort node degrees (Photo)
• Havel Hakimi using CountingSort algorithm to sort node degrees (Photo)
• Topological Sorting (100p)
• Critical Connections in a Network (success)
• Minimum meeting point for Romeo and Juliet (100p)
• Graph (100p)

Task 2

Solved problems:

• Kruskal’s Minimum Spanning Tree (100p)
• Disjoint (100p)
• Dijkstra (100p)
• Bellman-Ford (100p)

Task 3

Solved problems:

• Roy-Floyd (100p)
• MaxFlow (100p)
• Diameter of a tree (100p)

Task 4

Solved problems:

• Eulerian Cycle (100p)
• Minimum cost of Hamiltonian Cycle (100p)
• Maximum Bipartite Matching (100p)