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

*Instructors:*- Prof. Ron Shamir, Prof. Amos Fiat
*Assistants:*- Ophir Friedler, Tal Yankovich

Spring 2018:

*Term A*: 29/06/2018, 09:00*Term B*: 02/10/2018, 09:00

Fall 2018:

*Term A*: 20/02/2018, 09:00*Term B*: 28/03/2018, 09:00

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