Add Successive Shortest Path algorithm for Min-Cost Flow#1349
Add Successive Shortest Path algorithm for Min-Cost Flow#1349fabratu merged 39 commits intonetworkit:masterfrom
Conversation
Schwarf
force-pushed
the
feature/min_flow_shortest_successive_path
branch
from
46c3647 to
58a08bb
Compare
Schwarf
force-pushed
the
feature/min_flow_shortest_successive_path
branch
from
58a08bb to
4a348ec
Compare
|
Hi @fabratu, |
Yes, due to a new version of the macos toolkit, the deployment target of the wheel must be adjusted accordingly. We can ignore this error here, it is fixed in #1347. |
| solver.run(); | ||
| EXPECT_DOUBLE_EQ(solver.getTotalCost(), 0.0); | ||
| const auto flow = solver.getFlow(); | ||
| EXPECT_EQ(flow.size(), 0); |
There was a problem hiding this comment.
| EXPECT_EQ(flow.size(), 0); | |
| `EXPECT_THAT(flow, testing::IsEmpty());` |
There was a problem hiding this comment.
NetworKit::Attribute doesn’t define empty(), but it does define size(). So I’ll use EXPECT_THAT(flow, ::testing::SizeIs(0));.
|
Thanks for the contribution and review! The main review is older than 7 days, and all findings are addressed properly without any major discussions. Will merge this now. |
3 participants
Description
This PR introduces an implementation of the Successive Shortest Path (SSP) algorithm for solving the Minimum-Cost Flow problem.
SuccessiveShortestPathMinCostFlowclassProvides APIs to:
run())getTotalCost())getFlow())