Deep First Search in Graphs using Multithreading

Project made by Eduardo Henrique and Guilherme Lirioberto.

---

Table of Contents

• Goals
• Problems Encountered
• Demo
• Presentation
• References

---

Goals

Things we have done:

• Implement randomly generated graphs with a given size;
• Implement DFS with and without multithreading;

---

Problems Encountered

Problems:

1. Running through disconnected graphs;

Possible solutions:

1. Not required to solve this specific issue;

---

Demo

Each thread is represented by a color:

demo.mp4

---

Presentation

Our slide can be viewed in Canva.

---

References

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:

• Busca em Profundidade
• Parallel DFS