Shortest/Longest path on a Directed Acyclic Graph (DAG) | Graph Theory

Solution to finding the shortest (and longest) path on a Directed Acyclic Graph (DAG) using a topological sort in combination with dynamic programming. Topological sort video:    • Topological Sort Algorithm | Graph Theory   Github source code link: https://github.com/williamfiset/algor... =================================== Practicing for interviews? I have used, and recommend `Cracking the Coding Interview` which got me a job at Google. Link on Amazon: https://amzn.to/3cvMof5 A lot of the content on this channel is inspired by the book `Competitive Programming` by Steven Halim which I frequently use as a resource and reference. Link on Amazon: https://amzn.to/3wC2nix