0

Given a weighed directed acyclic graph (G) and a vertex S of G. I want to design a linear time dynamic programming algorithm to find the length of the shortest path between S and every other vertex of G.

John Sall
  • 1,027
  • 1
  • 12
  • 25
  • 1
    What makes you think such an algorithm exists? – Codor Feb 25 '19 at 15:34
  • 4
    Possible duplicate of [Directed graph linear algorithm](https://stackoverflow.com/questions/35775947/directed-graph-linear-algorithm) – Cerbrus Feb 27 '19 at 09:50

0 Answers0