12 Graph

Design and Analysis of Algorithms
Graph
Dr. Lê Nguyên Khôi
The VNU University of Engineering and Technology
Contents
 Definition
 Terminology
 Representation
 Traversal
 Topological sort
Design and Analysis of Algorithms 1

Definition
Graph consist of
 Set of vertices
 Set of edges
 Undirected graph
 Unordered pair of vertices
 Directed graph
 Ordered pair of vertices
Both cases,
if is connected,

Terminology
 Directed
 Weighted
 Connected
 Cycle
 Network

Terminology
undirected directed
Cầu Giấy Cầu Giấy
ĐHQG BX Kim Mã ĐHQG BX Kim Mã
Ngã tư Sở Ngã tư Sở

Terminology
unweighted weighted
Cầu Giấy 5 Cầu Giấy 7
ĐHQG BX Kim Mã ĐHQG BX Kim Mã
11 15
Ngã tư Sở Ngã tư Sở

Terminology
connected disconnected

Terminology
cycle no cycle

Network
 Transportation
 Communication
 Information
 Social
 Dependency

Transportation
PVD
ORD
SFO
LGA
HNL
LAX
DFW
MIA

Communication

Information

Social

Dependency

Representation
 Adjacency list
 One-dimensional array of lists
 Each list for a vertex consists of
Node such that
 Adjacency matrix
 Two-dimensional array
 Each vertex is numbered
Value of 1 indicates that

Adjacency List Representation
 An adjacency list of a vertex is the

list of vertices adjacent to

Adjacency Matrix Representation
 The adjacency matrix of a graph ,
where , is the matrix
given by

Representation
 Adjacency list
 Sparse graph
 is much smaller than
 Determine edges reached from
 Adjacency matrix
 Dense graph
 is close to
 Determine edge
 For both directed and undirected graphs

Traversal
 Determine the structure of a graph

 Visit all vertices of
 Each vertex is visited once
 Use all edges in
 02 methods
 Breath First Search – BFS
 Depth First Search – DFS

Breath First Search

Breath First Search
 From vertex , visit all vertices adjacent

to vertex which are not visited
 Then, the vertex is visited first, its
adjacent vertices are visited first
 Continue until all vertices are visited

Breath First Search – Pseudocode
Algorithm BFS(u)
Input: vertex u unvisited
Initialize an empty queue Q
Mark u visited
Q.enqueue(u)
while Q.empty() ≠ TRUE
v  Q.dequeue()
for (each w adjacent to v)
if (w is not visited)
Mark w is visited
Q.enqueue(w)

Breath First Search – Analysis
 Operation on the queue:

 Vertices are enqueued/dequeued only once
 Operation on the adjacency list:
 When vertices are dequeued
 Only once
 The length of the list
 Initialize:
 Mark all vertices unvisited
 Complexity:

Breath First Search – Application
 Determine if there is a path from to

 Check the connectivity of the graph
 Determine connected sub-graphs

Depth First Search

Depth First Search
 From visit adjacent to

 From visit adjacent to
 Continue until
 Reach which has no vertex to visit
 Go back to previous , visit other of
 Continue until all vertices are visited

Depth First Search – Pseudocode
Algorithm DFS(u)
Input: Vertex u unvisited
Mark u visited
for (each v adjacent to u)
if (v is not visited)
Mark v visited
DFS(v)

Depth First Search – Application
 Determine cycles

Topological Sort
 Relationship of a set of objects could be

represented by directed no cycle graph
 Sequential order relationship
 Timing relationship between tasks in the
scheme
 Timing relationships between subjects
in a curriculum

Topological Sort
LTNC
Toán
cao
cấp
LTHĐT CTDL
&GT
Trí tuệ LTTT

nhân
tạo

Sắp Xếp Topo
 là đồ thị định hướng không chu trình

 Sắp xếp các đỉnh đồ thị thành một danh sách
 Sao cho nếu có cung thì cần đứng
trước trong danh sách đó
a b
(a, c, b, d, e, f)
or
c d
(a, b, d, c, e, f)
…
e f

Topological Sort
DFS(a)
a b DFS(c)
DFS(e)
L = (e)
L = (e, c)
DFS(d)
c d DFS(f)
L = (e, c, f)
L = (e, c, f, d)
L = (e, c, f, d, a)
DFS(b)
e f L = (e, c, f, d, a, b)
L = (b, a, d, f, c, e)

Topological Sort
 Topological sort based on depth first

search
 Perform depth first search
 When finish the depth first search on
each vertex , then insert to the end of
the list
 When finish the depth first search on the
graph, reverse that list to obtain the
topological sort

12 Graph

Uploaded by

Copyright:

Available Formats

12 Graph

Uploaded by

Document Information

Original Title

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

12 Graph

Uploaded by

Copyright:

Available Formats

Design and Analysis of Algorithms

Design and Analysis of Algorithms 1

Design and Analysis of Algorithms 2

Design and Analysis of Algorithms 3

ĐHQG BX Kim Mã ĐHQG BX Kim Mã

Design and Analysis of Algorithms 4

ĐHQG BX Kim Mã ĐHQG BX Kim Mã

Design and Analysis of Algorithms 5

Design and Analysis of Algorithms 6

Design and Analysis of Algorithms 7

Design and Analysis of Algorithms 8

Design and Analysis of Algorithms 9

Design and Analysis of Algorithms 10

Design and Analysis of Algorithms 11

Design and Analysis of Algorithms 12

Design and Analysis of Algorithms 13

Design and Analysis of Algorithms 14

 An adjacency list of a vertex is the

Design and Analysis of Algorithms 15

Design and Analysis of Algorithms 16

Design and Analysis of Algorithms 17

 Determine the structure of a graph

Design and Analysis of Algorithms 18

Design and Analysis of Algorithms 19

 From vertex , visit all vertices adjacent

Design and Analysis of Algorithms 20

Design and Analysis of Algorithms 21

 Operation on the queue:

Design and Analysis of Algorithms 22

 Determine if there is a path from to

Design and Analysis of Algorithms 23

Design and Analysis of Algorithms 24

 From visit adjacent to

Design and Analysis of Algorithms 25

Design and Analysis of Algorithms 26

Design and Analysis of Algorithms 27

 Relationship of a set of objects could be

Design and Analysis of Algorithms 28

Trí tuệ LTTT

Design and Analysis of Algorithms 29

 là đồ thị định hướng không chu trình

Design and Analysis of Algorithms 30

Design and Analysis of Algorithms 31

 Topological sort based on depth first

Design and Analysis of Algorithms 32

You might also like