Initial commit.
Components solution based on DFS created (fails with TS).
BFS implemented
Array implementation for BFS components problem created.
BFS added to the fast graph implementation. Task 1 (Components) solution created.
 Task 2 (Shortest path) BFS solution created and successfully submitted.
 Task 3 (Shortest path in weighted graph) Bellman-Ford solution created and successfully submitted.
 Task 5 (Shortest path between all vertices) Floyd-Warshall solution created and successfully submitted.
Spanning tree solution created and basically tested. Solution fails with memory limit exceeded.
Documentation added to the spanning tree solution.
Merge branch 'master' into codereview
Code for tasks 1 - 3 and 5 is ready for review.