About shortest path/negative cycle on Bellman ford algorithm

Правка en4, от sayeed_1999, 2020-09-16 15:43:12

The algorithm computes from one source vertex the whole thing.

If i want to detect negative cycles in a graph using bellman ford, if i assume vertex 1 as the source, and no edge comes out of the vertex 1 in that test set, it wont work.

how will you consider source vertex in these cases... to detect negative cycles

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)