https://github.com/andreiglesias/lem-in

Efficient network algorithm to find the maximum flow within a network, with flow limitations.
https://github.com/andreiglesias/lem-in

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

Last synced: 8 months ago
JSON representation

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

• Host: GitHub
• URL: https://github.com/andreiglesias/lem-in
• Owner: AndreIglesias
• License: mit
• Created: 2020-09-01T00:25:29.000Z (about 5 years ago)
• Default Branch: master
• Last Pushed: 2024-04-28T22:57:29.000Z (over 1 year ago)
• Last Synced: 2025-01-18T12:47:27.996Z (9 months ago)
• Topics: 42, 42born2code, bfs, breadth-first-search, edmonds-karp, edmonds-karp-algorithm, lem-in, lemin
• Language: C
• Homepage:
• Size: 397 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# Lem-in

Lem-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.

## Overview

The 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.



  


  


  GUI by [amamy](https://git.42l.fr/amamy/Lem-in)



## Algorithm Details

- **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.

- **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.

## Contributing

Contributions 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.