intTypePromotion=1
zunia.vn Tuyển sinh 2024 dành cho Gen-Z zunia.vn zunia.vn
ADSENSE

Graphs

Chia sẻ: Lavie Lavie | Ngày: | Loại File: PDF | Số trang:57

41
lượt xem
3
download
 
  Download Vui lòng tải xuống để xem tài liệu đầy đủ

Graphsv includes Graphs (Definition, Applications, Terminology, Properties, ADT); Data structures for graphs (Edge list structure, Adjacency list structure, Adjacency matrix structure).

Chủ đề:
Lưu

Nội dung Text: Graphs

Graphs<br /> SFO<br /> <br /> LAX<br /> <br /> Graphs<br /> <br /> ORD<br /> <br /> DFW<br /> <br /> 1<br /> <br /> Outline and Reading<br /> Graphs (§12.1)<br /> <br /> <br /> <br /> <br /> <br /> <br /> <br /> Definition<br /> Applications<br /> Terminology<br /> Properties<br /> ADT<br /> <br /> Data structures for graphs (§12.2)<br /> <br /> <br /> <br /> <br /> <br /> Edge list structure<br /> Adjacency list structure<br /> Adjacency matrix structure<br /> Graphs<br /> <br /> 2<br /> <br /> Graph<br /> A graph is a pair (V, E), where<br /> <br /> <br /> <br /> <br /> V is a set of nodes, called vertices<br /> E is a collection of pairs of vertices, called edges<br /> Vertices and edges are positions and store elements<br /> <br /> Example:<br /> <br /> <br /> <br /> A vertex represents an airport and stores the three-letter airport code<br /> An edge represents a flight route between two airports and stores the<br /> mileage of the route<br /> <br /> PVD<br /> <br /> ORD<br /> <br /> SFO<br /> <br /> LGA<br /> <br /> HNL<br /> <br /> LAX<br /> <br /> DFW<br /> Graphs<br /> <br /> MIA<br /> 3<br /> <br /> Edge Types<br /> <br /> (u,v)<br /> <br /> Directed edge<br /> <br /> <br /> <br /> <br /> <br /> ordered pair of vertices (u,v)<br /> first vertex u is the origin<br /> second vertex v is the destination<br /> e.g., a flight<br /> <br /> Undirected edge<br /> <br /> <br /> <br /> unordered pair of vertices (u,v)<br /> e.g., a flight route<br /> <br /> Weighted edge<br /> Directed graph (Digraph)<br /> <br /> <br /> <br /> all the edges are directed<br /> e.g., route network<br /> <br /> u<br /> <br /> v<br /> <br /> flight<br /> ORD AA 1206 DFW<br /> 802 miles<br /> ORD<br /> <br /> flight<br /> DFW<br /> route<br /> 802 miles<br /> <br /> Undirected graph<br /> <br /> <br /> <br /> all the edges are undirected<br /> e.g., flight network<br /> <br /> Weighted graph<br /> <br /> <br /> all the edges are weighted<br /> Graphs<br /> <br /> 4<br /> <br /> Applications<br /> cslab1a<br /> <br /> cslab1b<br /> <br /> Electronic circuits<br /> <br /> <br /> <br /> math.brown.edu<br /> <br /> Printed circuit board<br /> Integrated circuit<br /> <br /> cs.brown.edu<br /> <br /> Transportation networks<br /> <br /> <br /> <br /> Highway network<br /> Flight network<br /> <br /> brown.edu<br /> qwest.net<br /> att.net<br /> <br /> Computer networks<br /> <br /> <br /> <br /> <br /> Local area network<br /> Internet<br /> Web<br /> <br /> cox.net<br /> John<br /> <br /> Databases<br /> <br /> <br /> Paul<br /> <br /> David<br /> <br /> Entity-relationship diagram<br /> Graphs<br /> <br /> 5<br /> <br />
ADSENSE

CÓ THỂ BẠN MUỐN DOWNLOAD

 

Đồng bộ tài khoản
2=>2