Bellman-Ford algorithm#69
Conversation
Changes to your CodeSee Architecture Map:View this PR diagram as an interactive map View more CodeSee Maps Legend |
The return of
where e is a pointer to the edge class. So @sidml if you want to add the test, I wait to merge this pull request. |
Codecov Report
@@ Coverage Diff @@
## master #69 +/- ##
==========================================
+ Coverage 94.48% 94.51% +0.03%
==========================================
Files 32 33 +1
Lines 2937 3081 +144
==========================================
+ Hits 2775 2912 +137
- Misses 162 169 +7
Flags with carried forward coverage won't be shown. Click here to find out more.
Continue to review full report at Codecov.
|

An implementation of Bellman-Ford algorithm as previously discussed here. I have also added a few test cases for checking the logic.
@ZigRazor Please take a look.
I wanted to add a test case with DirectedEdge (i.e. no weights) but that test case seems to be failing. I thought checking if
edge->isWeighted()is true or not would be sufficient, but that doesn't seem to be the case. Perhaps I am missing something..