Skip to content

Implementation of depth first search in graphs using multithreading

Notifications You must be signed in to change notification settings

Rosialdo/EduardoGuilherme_ws_OS_RR_2022

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

28 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Deep First Search in Graphs using Multithreading

Project made by Eduardo Henrique and Guilherme Lirioberto.


Table of Contents


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

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:

About

Implementation of depth first search in graphs using multithreading

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • C 100.0%