Negative cycles in min cost max flow algorithms

Open
#67 2 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
4/5
Estimated time
3-5 days
Newbie friendliness
25/100
Issue type
Bug
Clarity
Needs clarification
Activity status
Stale
Tech stack
java
Domain
backend

Research direction

Start by locating the Java Bellman-Ford min-cost flow implementations referenced in the issue and review how edge costs are handled. Add or run cases involving negative weighted edges and negative cycles; done means the algorithms correctly handle the supported negative-cost cases without breaking existing min-cost flow behavior.

Written by the indexing model from the issue text.

Description

The current implementation of the Bellman Ford min-cost flow algorithms seems to only support non-negative edge costs, but in reality, they should be able to handle negative weighted edges.

Dominant language
Java
Stars
18.8k
Forks
4.5k
No merged PRs in 30d

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from williamfiset/algorithms

All issues in williamfiset/algorithms

Similar issues

More Java issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.