Play around with:
 https://visualgo.net/en/maxflow
You can play around with different graphs, and apply both Ford-Fulkerson and Edmonds-Karp.

After that:
	•	 Use the algorithm to compute a maximum flow for the example uploaded to lisam and the homepage.
	•	 Apply DFS and BFS to the examples on lisam and the homepage.
	•	 Pick one problem we talked about during the course (e.g., Shortest Path Problem) and search for other applications than the one we had.