Skip to content

Max flow #4

@emiltayl

Description

@emiltayl

We should have implementations of Ford–Fulkerson. We could possibly go for both Edmonds–Karp (for sparse graphs) and Push-relabel maximum flow (for dense graphs).

Metadata

Metadata

Assignees

No one assigned

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions