GitHub / AndreIglesias / Lem-in

Efficient network algorithm to find the maximum flow within a network, with flow limitations.

JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AndreIglesias%2FLem-in
PURL: pkg:github/AndreIglesias/Lem-in

Stars: 1
Forks: 0
Open issues: 0

License: mit
Language: C
Size: 397 KB
Dependencies parsed at: Pending

Created at: almost 5 years ago
Updated at: over 1 year ago
Pushed at: over 1 year ago
Last synced at: 5 months ago

Topics: 42, 42born2code, bfs, breadth-first-search, edmonds-karp, edmonds-karp-algorithm, lem-in, lemin

Loading...