DMP221 Lecture 11

FACULTY OF INFORMATION TECHNOLOGY
Fall, 2023
Discrete Mathematics
Lecture 11: Graph – Part 3
Search Algorithms
Ta Quang Hung
Part 1: Introduction
Graph Theory Part 2: Depth-First-Search (DFS)

Part 3: Breath-First-Search (BFS)
Part 4: Summary
Contents
1 Introduction
2 Depth-First-Search (DFS) Algorithm
3 Breadth-First-Search (BFS) Algorithm
4 Summary
Part 3: Graph Theory Discrete Mathematics

The University of New South Wales Page 2
Introduction Part 2: Depth-First-Search (DFS)

Part 4: Summary
Search Algorithms
• Modern computing and the internet have made accessible a vast amount
of information. The ability to efficiently search through this information is
fundamental to processing it. This chapter describes classical searching
algorithms that have proven to be effective in numerous diverse
applications for decades. Without algorithms like these, the development
of the computational infrastructure that we enjoy in the modern world
would not have been possible.
• The term symbol table to describe an abstract mechanism where we
save information (a value) that we can later search for and retrieve by
specifying a key. The nature of the keys and the values depends upon
the application. There can be a huge number of keys and a huge amount
of information, so implementing an efficient symbol table is a significant
computational challenge.

Introduction Part 2: Depth-First-Search (DFS)

Part 4: Summary
Search Algorithms (cont'd)

• Symbol tables are sometimes called dictionaries, by
analogy with the time-honored system of providing definitions
for words by listing them alphabetically in a reference book.
In an English-language dictionary, a key is a word and its
values is the entry associated with the word that contains the
definition, pronunciation, and etymology.
• Symbol tables are also sometimes called indices, by analogy
with another time-honored system of providing access to
terms by listing them alphabetically at the end of a book such
as a textbook. In a book index, a key is a term of interest and
its value is the list of page numbers that tell readers where to
find that term in the book.

Depth-First-Search Algorithm
Searching Breadth-First-Search Algorithm
Depth-First-Search (DFS) Algorithm

• DFS is a general technique for traversing a graph.
• A DFS traversal of a graph G
 Visit all the vertices and edges of G.
 Determines whether G is connected.
 Computes the connected components of G.
 Computes a spanning forest of G.
• DFS on a graph with n vertices and m edges take O(n+m)
time.
• DFS can be further extended to solve other graph problems
 Find and report a path between two given vertices.
 Find a cycle.

DFS Algorithm (contd.)

DepthFirstSearch(s)
FOR (u=0: u<n; u= u+1) % scan all nodes
reached[u] = false; % set reached nodes to false
P.push(s); % push node s to stack P
WHILE (!P.Empty()) % Do while P is not empty
{
u = P.Pop(); % get data from stack, assign to a variable u
IF (!reached[u]) % if u is not reached node, then do
{
reached[u] = true; % set u is reached node.
FOR (x=adjList[u].Begin; x!=null; x=x.succ) % scan all adjacent nodes of u
{
v = x.Data; % get data of every adjacent nodes
of u
P.Push(v); % then push to stack P.
} % finish scan all adjacent nodes of u
}
} Part 3: Graph Theory Discrete % stack
Mathematics
The University P is
of New empty,
South all nodes are
Wales Page 6
DFS Algorithm: Simulation
1 0 5
Stack
2 6 7
3 4
Visited vertex
Unexplored vertex 0 1 2 3 4 5 6 7
Solving vertex

1 0 5
Stack
2 6 7
0
3 4
Visited vertex
Solving vertex

1 0 5
Stack
2 6 7
3 4
Visited vertex
Solving vertex 0

1 0 5
Stack
2 6 7
3 4
Visited vertex 0
Unexplored vertex 1 2 3 4 5 6 7
Solving vertex 0

1 0 5
Stack
2 6 7
2
3 4
Visited vertex 0
Solving vertex 0

1 0 5
Stack
2 6 7
3
2
3 4
Visited vertex 0
Solving vertex 0

1 0 5
Stack
2 6 7
5
3
2
3 4
Visited vertex 0
Solving vertex 0

1 0 5
Stack
2 6 7
3
2
3 4
Visited vertex 0
Solving vertex 5

1 0 5
Stack
2 6 7
3
2
3 4
Visited vertex 0 5
Unexplored vertex 1 2 3 4 6 7
Solving vertex 5

1 0 5
Stack
2 6 7
0
3
2
3 4
Visited vertex 0 5
Solving vertex 5

1 0 5
Stack
2 6 7
4
0
3
3 4 2
Visited vertex 0 5
Solving vertex 5

1 0 5
Stack
2 6 7
7
4
0
3 4 3
2
Visited vertex 0 5
Solving vertex 5

1 0 5
Stack
2 6 7
4
0
3
3 4 2
Visited vertex 0 5
Solving vertex 7

1 0 5
Stack
2 6 7
4
0
3
3 4 2
Visited vertex 0 5 7
Unexplored vertex 1 2 3 4 6
Solving vertex 7

1 0 5
Stack
2 6 7
4
4
0
3 4 3
2
Solving vertex 7

1 0 5
Stack
2 6 7
5
4
4
3 4 0
3
Visited vertex 0 5 7 2
Solving vertex 7

1 0 5
Stack
2 6 7
4
4
0
3 4 3
2
Solving vertex 5

1 0 5
Stack
2 6 7
4
0
3
3 4 2
Solving vertex 4

1 0 5
Stack
2 6 7
4
0
3
3 4 2
Unexplored vertex 1 2 3 6
Solving vertex 4

1 0 5
Stack
2 6 7
3
4
0
3 4 3
2
Solving vertex 4

1 0 5
Stack
2 6 7
5
3
4
3 4 0
3
Visited vertex 0 4 5 7 2
Solving vertex 4

1 0 5
Stack
2 6 7
7
5
3
3 4 4
0
Solving vertex 4

1 0 5
Stack
2 6 7
5
3
4
3 4 0
3
Solving vertex 7

1 0 5
Stack
2 6 7
3
4
0
3 4 3
2
Solving vertex 5

1 0 5
Stack
2 6 7
4
0
3
3 4 2
Solving vertex 3

1 0 5
Stack
2 6 7
4
0
3
3 4 2
Unexplored vertex 1 2 6
Solving vertex 3

1 0 5
Stack
2 6 7
0
4
0
3 4 3
2
Solving vertex 3

1 0 5
Stack
2 6 7
4
0
4
3 4 0
3
Visited vertex 0 3 4 5 7 2
Solving vertex 3

1 0 5
Stack
2 6 7
6
4
0
3 4 4
0
Solving vertex 3

1 0 5
Stack
2 6 7
4
0
4
3 4 0
3
Solving vertex 6

1 0 5
Stack
2 6 7
4
0
4
3 4 0
3
Visited vertex 0 3 4 5 6 7 2
Unexplored vertex 1 2
Solving vertex 6

1 0 5
Stack
2 6 7
3
4
0
3 4 4
0
Solving vertex 6

1 0 5
Stack
2 6 7
4
0
4
3 4 0
3
Solving vertex 3

1 0 5
Stack
2 6 7
0
4
0
3 4 3
2
Solving vertex 4

1 0 5
Stack
2 6 7
4
0
3
3 4 2
Solving vertex 0

1 0 5
Stack
2 6 7
0
3
2
3 4
Solving vertex 4

1 0 5
Stack
2 6 7
3
2
3 4
Solving vertex 0

1 0 5
Stack
2 6 7
2
3 4
Solving vertex 3

1 0 5
Stack
2 6 7
3 4
Solving vertex 2

1 0 5
Stack
2 6 7
0
3 4
Unexplored vertex 1
Solving vertex 2

1 0 5
Stack
2 6 7
1
0
3 4
Unexplored vertex 1
Solving vertex 2

1 0 5
Stack
2 6 7
0
3 4
Unexplored vertex 1
Solving vertex 1

1 0 5
Stack
2 6 7
2
0
3 4
Visited vertex 0 1 2 3 4 5 6 7
Unexplored vertex
Solving vertex 1

1 0 5
Stack
2 6 7
0
3 4
Unexplored vertex
Solving vertex 2

1 0 5
Stack
2 6 7
3 4
Unexplored vertex
Solving vertex 0

1 0 5
Stack
2 6 7
3 4
Unexplored vertex
Solving vertex

DFS Algorithm: Properties
1. DFS(G,v) visits all the vertices and edges in

the connected component of v.
2. The discovery edges labeled by DFS(G,v)
form a spanning tree of the connected
component of v.

Breadth-First-Search (BFS) Algorithm

• BFS is a general technique for traversing a graph.
• A BFS traversal of a graph G
 Visit all the vertices and edges of G.
 Determines whether G is connected.
 Computes the connected components of G.
 Computes a spanning forest of G.
• BFS on a graph with n vertices and m edges take O(n+m)
time.
• BFS can be further extended to solve other graph problems
 Find and report a paht with the minimum number of edges between
two given vertices.
 Find a simple cycle, if there is one.

BFS Algorithm (contd.)

BreadthFirstSearch(s)
FOR (u=0: u<n; u= u+1) % scan all nodes
reached[u] = false; % set reached nodes to false
Q.enqueue(s); % push node s to queue Q
WHILE (!Q.Empty()) % Do while Q is not empty
{
u = Q.Dequeue(); % get data from queue, assign to u
IF (!reached[u]) % if u is not reached node, then do
{
reached[u] = true; % set u is reached node.
FOR (x=adjList[u].Begin; x!=null; x=x.succ) % scan all adjacent nodes of u
{
v = x.Data; % get data of every adjacent nodes
of u
Q.Enqueue(v); % then push to queue Q.
} % finish scan all adjacent nodes of u
}
} Part 3: Graph Theory Discrete % queue
of NewQSouth
Mathematics
The University is empty,
Walesall nodesPage
are 55
BFS Algorithm (contd.)
• Each vertex is labeled twice

– once as unexpolored.
– once as visited.
• Each edge is labeled twice
– once as unexplored.
– once as discovery or cross.

BFS Algorithm: Simulation
Queue
1
0 5
2
6 7
3 4
Visited vertex
Solving vertex

Queue
1
0 5
2
6 7
3 4
Visited vertex
0
Solving vertex

Queue
1
0 5
2
6 7
3 4
Visited vertex
Solving vertex 0

Queue
1
0 5
2
6 7
3 4
Visited vertex 0
Solving vertex 0

Queue
1
0 5
2
6 7
3 4
Visited vertex 0
1
Solving vertex 0

Queue
1
0 5
2
6 7
3 4
Visited vertex 0
2
1
Solving vertex 0

Queue
1
0 5
2
6 7
3 4
3
Visited vertex 0
2
1
Solving vertex 0

Queue
1
0 5
2
6 7
3 4
5
3
Visited vertex 0
2
1
Solving vertex 0

Queue
1
0 5
2
6 7
3 4
5
Visited vertex 0
3
2
Solving vertex 1

Queue
1
0 5
2
6 7
3 4
5
Visited vertex 0 1
3
2
Solving vertex 1

Queue
1
0 5
2
6 7
3 4
0
5
Visited vertex 0 1
3
2
Solving vertex 1

Queue
1
0 5
2
6 7
2
3 4
0
5
Visited vertex 0 1
3
2
Solving vertex 1

Queue
1
0 5
2
6 7
3 4
2
0
Visited vertex 0 1
5
3
Solving vertex 2

Queue
1
0 5
2
6 7
3 4
2
0
5
3
Solving vertex 2

Queue
1
0 5
2
6 7
0
3 4
2
0
5
3
Solving vertex 2

Queue
1
0 5
2
6 7
1
0
3 4
2
0
5
3
Solving vertex 2

Queue
1
0 5
2
6 7
1
3 4
0
2
0
5
Solving vertex 3

Queue
1
0 5
2
6 7
1
3 4
0
2
0
5
Solving vertex 3

Queue
1
0 5
2
6 7
0
1
3 4
0
2
0
5
Solving vertex 3

Queue
1
0 5
2
6 7
4
0
1
3 4
0
2
0
5
Solving vertex 3

Queue
1
0 5
2 6
6 7
4
0
1
3 4
0
2
0
5
Solving vertex 3

Queue
1
0 5
2
6 7
6
4
0
3 4
1
0
2
0
Solving vertex 5

Queue
1
0 5
2
6 7
6
4
0
3 4
1
0
2
0
Solving vertex 5

Queue
1
0 5
2 0
6 7
6
4
0
3 4
1
0
2
0
Solving vertex 5

Queue
1
0 5
4
2 0
6 7
6
4
0
3 4
1
0
2
0
Solving vertex 5

Queue
1
0 5 6
4
2 0
6 7
6
4
0
3 4
1
0
2
0
Solving vertex 5

Queue
1
7
0 5 6
4
2 0
6 7
6
4
0
3 4
1
0
2
0
Solving vertex 5

Queue
1
0 5 7
6
2 4
6 7
0
6
4
3 4
0
1
0
2
Solving vertex 0

Queue
1
0 5
7
2 6
6 7
4
0
6
3 4
4
0
1
0
Solving vertex 2

Queue
1
0 5
2 7
6 7
6
4
0
3 4
6
4
0
1
Solving vertex 0

Queue
1
0 5
2
6 7
7
6
4
3 4
0
6
4
0
Solving vertex 1

Queue
1
0 5
2
6 7
7
6
3 4
4
0
6
4
Solving vertex 0

Queue
1
0 5
2
6 7
7
3 4
6
4
0
6
Solving vertex 4

Queue
1
0 5
2
6 7
7
3 4
6
4
0
6
Solving vertex 4

Queue
1
0 5
2
6 7
3
7
3 4
6
4
0
6
Solving vertex 4

Queue
1
0 5
2
6 7
5
3
7
3 4
6
4
0
6
Solving vertex 4

Queue
1
0 5
2 7
6 7
5
3
7
3 4
6
4
0
6
Solving vertex 4

Queue
1
0 5
2
6 7
7
5
3
3 4
7
6
4
0
Solving vertex 6

Queue
1
0 5
2
6 7
7
5
3
3 4
7
6
4
Unexplored vertex 7
0
Solving vertex 6

Queue
1
0 5
2 3
6 7
7
5
3
3 4
7
6
4
Unexplored vertex 7
0
Solving vertex 6

Queue
1
0 5
5
2 3
6 7
7
5
3
3 4
7
6
4
Unexplored vertex 7
0
Solving vertex 6

Queue
1
0 5
2 5
6 7
3
7
5
3 4
3
7
6
Unexplored vertex 7
4
Solving vertex 0

Queue
1
0 5
2
6 7
5
3
7
3 4
5
3
7
Unexplored vertex 7
6
Solving vertex 4

Queue
1
0 5
2
6 7
5
3
3 4
7
5
3
Unexplored vertex 7
7
Solving vertex 6

Queue
1
0 5
2
6 7
5
3 4
3
7
5
Unexplored vertex 7
3
Solving vertex 7

Queue
1
0 5
2
6 7
5
3 4
3
7
5
Unexplored vertex
3
Solving vertex 7

Queue
1
0 5
2
6 7
4
5
3 4
3
7
5
Unexplored vertex
3
Solving vertex 7

Queue
1
0 5
2
6 7
5
4
5
3 4
3
7
5
Unexplored vertex
3
Solving vertex 7

Queue
1
0 5
2
6 7
5
4
3 4
5
3
7
Unexplored vertex
5
Solving vertex 3

Queue
1
0 5
2
6 7
5
3 4
4
5
3
Unexplored vertex
7
Solving vertex 5

Queue
1
0 5
2
6 7
3 4
5
4
5
Unexplored vertex
3
Solving vertex 7

Queue
1
0 5
2
6 7
3 4
5
4
Unexplored vertex
5
Solving vertex 3

Queue
1
0 5
2
6 7
3 4
5
Unexplored vertex
4
Solving vertex 5

Queue
1
0 5
2
6 7
3 4
Unexplored vertex
5
Solving vertex 4

Queue
1
0 5
2
6 7
3 4
Unexplored vertex
Solving vertex 5

Queue
1
0 5
2
6 7
3 4
Unexplored vertex
Solving vertex

DFS vs. BFS
Applications DFS BFS

Spanning forest, Yes Yes
connected
components,
paths, cycles.
Shortest paths Yes

Biconnected Yes
components


DMP221 Lecture 11

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DMP221 Lecture 11

Uploaded by

Copyright:

Available Formats

FACULTY OF INFORMATION TECHNOLOGY

Graph Theory Part 2: Depth-First-Search (DFS)

Part 3: Graph Theory Discrete Mathematics

Introduction Part 2: Depth-First-Search (DFS)

Part 3: Graph Theory Discrete Mathematics

Introduction Part 2: Depth-First-Search (DFS)

Search Algorithms (cont'd)

Part 3: Graph Theory Discrete Mathematics

Depth-First-Search (DFS) Algorithm

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm (contd.)

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics

DFS Algorithm: Simulation

Part 3: Graph Theory Discrete Mathematics