Graphlib 3.1, the newest version of Graphlib has added a bunch of new features and algorithms we are excited to show.

BFS: The BFS algorithm is finally done and implemented DFS: The DFS algorithm is also finished Dijkstra's algorithm is 90% finished! It will be released on version 3.2

NEW ADDITIONS:

Reshaped README.md Added more functions BFS was added DFS was added graphlib:: namespace was added You are now able to do more than just integers for node names (check README) weights can now be integers or floats! Heavy performance improvements!

If you want, come check out Graphlib!