Ahmed Bera Pay's Projects
Config files for my GitHub profile.
In this project, tennis player visits of three different services and waitings in queue as a dicrete event simulation is implemented.
In this project gifts are distributed via different vehicles which difference sizes. This project actually models the implementation of a network flow. The program tries to find a solution to distribute all the gifts without excessing vehicle capacities based on Ford-Fulkerson's max flow algorithm.
In this project a country is modeled with edges and vertices and assigned two vertices as locations of Mecnun and Leyla. This program finds the shortest path for Mecnun to reach Leyla based on Dijkstra's algorithm, and then finds a honeymoon route for them which is actually a minimum spanning tree.