Please read the new rule regarding the restriction on the use of AI tools. ×

About shortest path/negative cycle on Bellman ford algorithm

Revision en1, by 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..

Tags shortest path, negative cycle, bellman ford

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English sayeed_1999 2020-09-16 15:43:12 230
en3 English sayeed_1999 2020-09-16 15:27:29 6 Tiny change: 'ont work\nasking for ' -> 'ont work\n\n\nAsking for '
en2 English sayeed_1999 2020-09-16 15:26:31 72
en1 English sayeed_1999 2020-09-16 15:25:17 348 Initial revision (published)