Grokking Algorithms: An illustrated guide for programmers and other curious people by Aditya Y. Bhargava

Author:Aditya Y. Bhargava [Aditya Y. Bhargava]
Language: eng
Format: epub
Tags: Core Programming
Publisher: Manning Publications
Published: 2016-05-16T16:00:00+00:00

You also keep a queue of every person to search. Adding one person to the queue takes constant time: O(1). Doing this for every person will take O(number of people) total. Breadth-first search takes O(number of people + number of edges), and it’s more commonly written as O(V+E) (V for number of vertices, E for number of edges).

Exercise

Here’s a small graph of my morning routine.

It tells you that I can’t eat breakfast until I’ve brushed my teeth. So “eat breakfast” depends on “brush teeth”.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.