libgraph icon indicating copy to clipboard operation
libgraph copied to clipboard
verified publisher icon bitwalker

Add Bellman ford alogorythm

Open vsevolod opened this issue 6 years ago • 1 comments

  • [x] Counting shortests path per vertex
  • [x] Detect if negative cycle exists

vsevolod avatar Aug 11 '19 18:08 vsevolod

Coverage Status

Coverage increased (+0.1%) to 96.148% when pulling 3b179f5c6ef72a3f28a568003ba0e09881a33e9f on vsevolod:add-bellman-ford-algo into 493d91d214418bbd9607881bb1db270352b27a26 on bitwalker:master.

coveralls avatar Aug 11 '19 18:08 coveralls

I've merged this manually, thanks for the contribution!

bitwalker avatar Sep 09 '22 16:09 bitwalker