Groutenetwork undirectedgraph

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: the edges are directed e.g., route network Undirected graph all the edges are undirected e.g., flight network © 2010 Goodrich, Tamassia Graphs 3 Applications Electronic circuits Printed circuit board Integrated circuit cs.brown.edu Highway network Flight network brown.edu Computer networks qwest.net att.net Local area network Internet Web Databases cslab1b math.brown.edu Transportation networks cslab1a cox.net John Paul David Entity­relationship diagram © 2010 Goodrich, Tamassia Graphs 4 Terminology End vertices (or endpoints) of an edge X has degree 5 b h X e W g f h and i are parallel edges Self­loop V d c Parallel edges U and V are adjacent U Degree of a vertex a, d, and b are incident on V Adjacent vertices a Edges incident on a vertex U and V are the endpoints of a j Z i Y j is a self­loop © 2010 Goodrich, Tamassia Graphs...
View Full Document

This document was uploaded on 02/05/2014.

Ask a homework question - tutors are online