May 7, 2015
We focus on the BFS algorithm as depicted in Figure 1. It performs a breadth-first
search of G starting at a node s.
Unmark all vertices
visit and mark (s)
044268: Introduction to
Data Structures & Algorithms
Prof. Yoram Moses
Course material on Moodle
Intro to Data Structures and Algorithms
Introduction, Slide 1
Problem Solving by Computer
Intro to Data Structur
What is a computational problem?
How is it defined?
What is a solution?
How do we evaluate the solution?
How do we prove the solution is correct?
Study basic data structures
Study basic algorithmic techniques
Intro to Data Structures and Algori
Strongly Connected Components
G is strongly connected if every pair (u, v) of vertices in
G is reachable from one another.
A strongly connected component (SCC) of G is a
maximal set of