{"id":20802629,"url":"https://github.com/andreiglesias/lem-in","last_synced_at":"2026-04-22T00:32:11.369Z","repository":{"id":83157272,"uuid":"291854797","full_name":"AndreIglesias/Lem-in","owner":"AndreIglesias","description":"Efficient network algorithm to find the maximum flow within a network, with flow limitations.","archived":false,"fork":false,"pushed_at":"2024-04-28T22:57:29.000Z","size":407,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-12-27T09:59:41.079Z","etag":null,"topics":["42","42born2code","bfs","breadth-first-search","edmonds-karp","edmonds-karp-algorithm","lem-in","lemin"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/AndreIglesias.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2020-09-01T00:25:29.000Z","updated_at":"2024-04-28T22:57:32.000Z","dependencies_parsed_at":null,"dependency_job_id":"26b990e6-1b31-476e-831f-d00c17388e82","html_url":"https://github.com/AndreIglesias/Lem-in","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/AndreIglesias/Lem-in","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AndreIglesias%2FLem-in","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AndreIglesias%2FLem-in/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AndreIglesias%2FLem-in/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AndreIglesias%2FLem-in/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/AndreIglesias","download_url":"https://codeload.github.com/AndreIglesias/Lem-in/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AndreIglesias%2FLem-in/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32115816,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-22T00:31:26.853Z","status":"ssl_error","status_checked_at":"2026-04-22T00:30:22.894Z","response_time":128,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["42","42born2code","bfs","breadth-first-search","edmonds-karp","edmonds-karp-algorithm","lem-in","lemin"],"created_at":"2024-11-17T18:33:50.202Z","updated_at":"2026-04-22T00:32:11.328Z","avatar_url":"https://github.com/AndreIglesias.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Lem-in\nLem-in is an algorithmic project that focuses on finding the maximum flow in a flow network with limited capacity. This project explores the use of the Edmonds-Karp algorithm to compute the maximum flow and employs Breadth-First Search (BFS) to explore nodes by level.\n\n## Overview\n\nThe objective of the project is to find the optimal path through a network, simulating the movement of ants through a maze with specific constraints on capacity and flow. This concept has practical applications in various fields, such as traffic optimization, data packet routing, and supply chain management.\n\n\u003cp align=\"center\"\u003e\n  \u003cbr /\u003e\n  \u003cimg src=\"lemin.gif?raw=true\" /\u003e\u003cbr/\u003e\n  \u003csub\u003eGUI by [amamy](https://git.42l.fr/amamy/Lem-in)\u003c/sub\u003e\n\u003c/p\u003e\n\n## Algorithm Details\n\n- **Edmonds-Karp Algorithm**: A variant of the Ford-Fulkerson method, which uses BFS to find augmenting paths in the flow network. It ensures the maximum flow is computed efficiently and reliably.\n\n- **Breadth-First Search (BFS)**: A traversal algorithm that explores nodes level-by-level, facilitating the identification of the shortest paths and augmenting paths for the flow algorithm.\n\n\n## Contributing\n\nContributions to the Lem-in project are welcome! If you would like to contribute, please fork the repository and submit a pull request with your changes. For major changes, open an issue to discuss your ideas before implementing them.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fandreiglesias%2Flem-in","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fandreiglesias%2Flem-in","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fandreiglesias%2Flem-in/lists"}