Graph Algorithms

Contains implementation of most famous algorithms on the graph. Includes algorithms as follows.

Implemented Algorithms

• Dijkstra algorithm
• Floyd–Warshall algorithm (Extension to Dijkstra method for negative-weighted edges in graph)
• Fleury's Algorithm (Finds Eulerian path and circuit in undirected graph)
• Depth-First Search
• Breadth-First Search
• Solving a Maze
• Kahn's algorithm (Topological sort)
• Hierholzer's algorithm (Eulerian path of directed graph)

Implemented Data Structues

• Graph as objects and pointers
• Graph by adjacency matrix
• Graph by adjacency list