Connecting Everything With Graphs

Exercises for Chapter #13 of A Common-Sense Guide To Data Structures and Algorithms

Get The Book!

Chapter Exercises

Exercise #1

Write a function that conducts depth-first search on a graph.

Exercise #2

What is the efficiency of depth-first search in terms of Big O Notation?

Exercise #3

Write a method that uses breadth-first search to search for a node within a graph.

Exercise #4

Write a method that deletes a node from a graph.

Let's Get In Touch!

Join the forum on The Pragmatic Programmers website to join in on the conversation about this book, or email Jay Wengrow, author of the book and this website directly.