Modern C++ implementation of Graph Algorithms for Sedgewick's Algotirhms 4th When I say modern C++, I mean C++11/14

Currently version 1.0 has come out the list below shows the data structure and algorithms has been implemented.

split method

this structure is quite a little bit fuzzy, read the source code to gain more info

Weighted quick-union with path compression

using vector<vector<size_t>> adjList as core structure

BFS features a queue<size_t> structure while DFS takes advantage of system call stack

using DFS

using DFS

using a map string ---> index

also using vector> adjList as core structure