Realisation of all main Graph algorithms:
1)DFS (https://en.wikipedia.org/wiki/Depth-first_search)
2)BFS (https://en.wikipedia.org/wiki/Breadth-first_search)
3)Kruskal's algorithm (https://en.wikipedia.org/wiki/Kruskal%27s_algorithm)
4)Prim's algorithm (https://en.wikipedia.org/wiki/Prim%27s_algorithm)
5)Dijkstra's algorithm (https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm)
6)Floyd–Warshall algorithm (https://en.wikipedia.org/wiki/Floyd–Warshall_algorithm)
7)Kosaraju's algorithm (https://en.wikipedia.org/wiki/Kosaraju%27s_algorithm)