algorithm - is bellman-ford can be done in a single iteration? -
does every graph have order of edges such after running single iteration of bellman-ford algorithm according order, every vertex labeled it's shortest path source ?
i'm quiet sure answer yes, can't think of algorithm able find order of edges, =]
sort shortest path tree topologically.
Comments
Post a Comment