Project made by Eduardo Henrique and Guilherme Lirioberto.
Things we have done:
- Implement randomly generated graphs with a given size;
- Implement DFS with and without multithreading;
Problems:
- Running through disconnected graphs;
Possible solutions:
- Not required to solve this specific issue;
Each thread is represented by a color:
demo.mp4
Our slide can be viewed in Canva.
Most of the code regarding graphs was inspired by this Youtube Video.
Most of the code regarding DFS using multithreading was adapted from this Github Repo.
We have also used the references given out by our professor: