libgraph
libgraph copied to clipboard
Add Bellman ford alogorythm
- [x] Counting shortests path per vertex
- [x] Detect if negative cycle exists
Coverage increased (+0.1%) to 96.148% when pulling 3b179f5c6ef72a3f28a568003ba0e09881a33e9f on vsevolod:add-bellman-ford-algo into 493d91d214418bbd9607881bb1db270352b27a26 on bitwalker:master.
I've merged this manually, thanks for the contribution!