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
- Alon Eden

*Exam*: 10/07/2017, 14:00*Moed B*: 01/10/2017

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