Add Bellman ford alogorythm

bitwalker / libgraph

A graph data structure library for Elixir projects

MIT License

524 stars 75 forks source link

Add Bellman ford alogorythm #31

Closed vsevolod closed 1 year ago

vsevolod commented 5 years ago

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

coveralls commented 5 years ago

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

bitwalker commented 1 year ago

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