Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword or section
Like this
12Activity

Table Of Contents

0 of .
Results for:
No results containing your search query
P. 1
unit8-sp

unit8-sp

Ratings: (0)|Views: 1,593 |Likes:
Published by hrsli
Author:
張耀文
Yao-Wen Chang
ywchang@cc.ee.ntu.edu.tw
http://cc.ee.ntu.edu.tw/~ywchang
Graduate Institute of Electronics Engineering
Department of Electrical Engineering
National Taiwan University
Fall 2004
Author:
張耀文
Yao-Wen Chang
ywchang@cc.ee.ntu.edu.tw
http://cc.ee.ntu.edu.tw/~ywchang
Graduate Institute of Electronics Engineering
Department of Electrical Engineering
National Taiwan University
Fall 2004

More info:

Published by: hrsli on May 31, 2009
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

05/11/2014

pdf

text

original

 
Y.-W. Chang
1
Unit 8
Unit 8: Graphs
Course contents:
 ⎯ 
Elementary graph algorithms
 ⎯ 
Minimum spanning trees
 ⎯ 
Shortest paths
 ⎯ 
Maximum flow
Reading:
 ⎯ 
Chapters 22, 23, 24, 25
 ⎯ 
Chapter 26.1—26.3
 
Y.-W. Chang
2
Unit 8
Graphs
A
graph
= (
V, E 
) consists of a set
of
vertices
(
nodes
) and a set
of
directed
or
undirected edges
.
 ⎯ 
For analysis, we use
for |
| and
for |
|.
Anybinaryrelation is a graph.
 ⎯ 
Network of roads and cities, circuit representation, etc.
 
Y.-W. Chang
3
Unit 8
Representations of Graphs: Adjacency List
Adjacency list:
An array
Adj 
of |
| lists, one for eachvertex in
. For each
,
Adj 
[
] pointers to all thevertices adjacent to
.
Advantage:
(
V+E 
) storage, good for
sparse
graph.
Drawback: Need to traverse list to find an edge.
2

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->