Merge branch 'release/0.4' into develop
Space complexity of a graph improved to O(V + E)
Dijkstra algorithm works with directed graphs with non-integer edge weights
Readme file updated
Merge branch 'feature/space_efficient_graph' into develop
Non-recursive version of DFS algorithm
DFS algorithm in readme file updated
Fixed DFS algorithm
Merge branch 'feature/nonrecursive_dfs' into develop
Containers use heap instead of stack
Graph uses heap instead of stack
Fill constructor added to vector class
DFS and BFS use heap instead of stack
Prim's algorithm uses heap instead of stack
Dijkstra algorithm uses heap instead of stack
Merge branch 'feature/heap_based_algorithms' into develop
Build system reorganized
Travis-ci file updated
Cleanup
Travis-ci file updated