In recitation 6, slide 16 you mentioned we saw a linear algorithm for finding single source shortest paths in an acyclic graph. Can you remind what was this algorithm?

Linear SSSP algorithm in acyclic graph

*Instructor:*- Dr. Rani Hod
*Assistants:*- Jad Silbak
- Tal Yankovich

*Term A*: 12/02/2019*Term B*: 15/03/2019

[[div style="direction:rtl; text-align:right"]]

מילים (סוגריים)

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License