Graph algorithms implementation

The project was made as part of the Coding Interview University course.

topological sort without using DFS

Depth-first search (DFS)

• Recursive version of the algorithm
• Iterative version of the algorithm
• Algorithm counting connected components graph
• Topological sort

Paths in the graph

• Iterative version breadth first search
• Dijkstra's algorithm
• Bellman-Ford’s algorithm

Spanning tree

• Kruskal's algorithm
• Prim's algorithm
• Disjointed set union (DSU)