About shortest path/negative cycle on Bellman ford algorithm

Правка en2, от sayeed_1999, 2020-09-16 15:26:31

The algorithm computes from one source vertex the whole thing.

What if no edges come out from the vertex i assume as source? how do you do it?

In any test set, If i assume vertex-1 as source, no edges come out from vertex 1, but only comes in... i think it wont work asking for solutions..

Теги shortest path, negative cycle, bellman ford

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en4 Английский sayeed_1999 2020-09-16 15:43:12 230
en3 Английский sayeed_1999 2020-09-16 15:27:29 6 Tiny change: 'ont work\nasking for ' -> 'ont work\n\n\nAsking for '
en2 Английский sayeed_1999 2020-09-16 15:26:31 72
en1 Английский sayeed_1999 2020-09-16 15:25:17 348 Initial revision (published)