June 2020
Intermediate to advanced
382 pages
11h 39m
English
Content preview from 40 Algorithms Every Programmer Should Know
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
Start your free trial
Initialization
We will use two data structures:
visited: This contains all the vertices that have been visited. Initially, it will be empty.
queue: This contains all the vertices that we have want to visit in next iterations.