Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Work on Edmonds-Karp algorithm #162

Closed
wants to merge 4 commits into from
Closed

Work on Edmonds-Karp algorithm #162

wants to merge 4 commits into from

Conversation

ndcroos
Copy link
Contributor

@ndcroos ndcroos commented Oct 19, 2023

See #83

  • Documentation entry can be extended
  • More unit tests could be added
  • It doesn't re-use the existing BF method, because I found it easier to implement the algorithm without it.
  • The algorithm uses a residual_graph_adapter_t structure. Maybe the location of this file could be better somewhere else.
  • In residual_graph.h, I am not sure whether I used the get_edges and get_weight methods in the correct way (with [edge_id, edge] and residual_capacities[edge_id]).

@github-actions GitHub Actions
Copy link
Contributor

github-actions bot commented Nov 3, 2023

Stale pull request message

@github-actions github-actions bot closed this Nov 10, 2023
@bobluppes bobluppes reopened this Nov 25, 2023
@github-actions GitHub Actions
Copy link
Contributor

Stale pull request message

@github-actions github-actions bot closed this Dec 19, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
no-pr-activity
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
2 participants
@ndcroos @bobluppes