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

Popular posts from this blog

ruby on rails - RuntimeError: Circular dependency detected while autoloading constant - ActiveAdmin.register Role -

c++ - OpenMP unpredictable overhead -

javascript - Wordpress slider, not displayed 100% width -