This code has a Breadth First Search, Depth First Search, and Dijkstra's shortest path algorithm that are used on a Graph class. Both are written iteratively. The Graph class is written using an ...

Add, delete & complete tasks (filterable by date, priority, category) View tasks sorted via merge-sort on a cloned list Enqueue completed tasks in FIFO order Get a “recommended next task” via a ...