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
Get url with snipboard.io. Attach image with
[[image image-url width="100%"]]
[[div style="direction:rtl; text-align:right"]]
מילים (סוגריים)