After spending some time on Leetcode, I got bored of repetitive drilling.  I wanted to keep learning and decided to dive deeper into Graph Algorithms.  I find Graph Algorithms particularly appealing because most if not all problems can be modeled using Graphs.  As such, mastery of canonical Graph Algorithms should prove generally useful long term. I picked up a book on graph theory as a primer. However, as I looked around for resources on applied computer science algorithms I found that there wasn't much out there. Based on what I'd seen on Leetcode and read in Needham and Hodlers' "Graph Algorithms" book (mostly a users guide to Neo4J ), I took it upon myself to collate a brief collection of graph algorithms for self use.  The exercise has been rewarding.  The code is mostly intended as a learning tool. If you're at all interested in Graph Algorithms, by all means check it out.