Пожалуйста, прочтите новое правило об ограничении использования AI-инструментов. ×

About shortest path/negative cycle on Bellman ford algorithm

Правка en1, от sayeed_1999, 2020-09-16 15:25:17

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?

If i assume the first vertex as source, and in the test case, no edges come out from vertex 1, but only comes in... 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)