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

Publicado el: 18 octubre 2017
en el canal de: WilliamFiset

193,275

2.3k

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

En esta página del sitio puede ver el video en línea Shortest/Longest path on a Directed Acyclic Graph (DAG) | Graph Theory de Duración hora minuto segunda en buena calidad , que subió el usuario WilliamFiset 18 octubre 2017, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 193,275 veces y le gustó 2.3 mil a los espectadores. Disfruta viendo!

37,384

1.6K

00:00:00