In this repository, you will learn the basics and how to implement and test:

• Graphs: A graph is a data structure that consists of a finite set of vertices (also called nodes) and a set of edges connecting these vertices.
• Stacks: A stack is a linear data structure that follows the last-in, first-out (LIFO) principle Read more
• Queues: A queue is a linear data structure that follows the "first-in, first-out" (FIFO) principle. Read more
• Depth-First Search (DFS): A search algorithm that explores the vertices of a graph in a depth-first manner.
  • Recursive DFS
  • Stack DFS
• Breadth-First Search (BFS): A search algorithm that explores the vertices of a graph in a breadth-first manner.
  • Queue BFS

✅ Everything has TESTS! I highly recommend to clone this repo and remove my implementations so you can code your own and then follow a TDD approach.

💪 follow me on Github, Tiktok or Youtube

If you would like to contribute to this repository, please feel free to open a pull request or file an issue.

I hope this helps! Let me know if you have any questions or need further assistance.