Algorithms in a Nutshell

Overview | 137

Graph

Algorithms

Weighted graphs

Model relationships where there is a numeric value known as aweightassoci-

ated with the relationship between vertices (u,v). Sometimes these values can

store arbitrary non-numeric information. For example, the edge between

towns A and B could store the mileage between the towns; alternatively, it

could store estimated traveling time in minutes.

Hypergraphs

Model multiple relationships that may exist between the same two vertices

(u,v); in this chapter, however, we will limit our discussion to simple graphs.

Figure 6-1. (a) House of Tudor, (b) computer network, (c) airline schedule

Algorithms in a Nutshell
Algorithms in a Nutshell By Gary Pollice, George T. Heineman, Stanley Selkow ISBN:
9780596516246 Publisher: O'Reilly Media, Inc.

Prepared for Ming Yi, Safari ID: [email protected]
Licensed by Ming Yi
Print Publication Date: 2008/10/21 User number: 594243
© 2009 Safari Books Online, LLC. This PDF is made available for personal use only during the relevant subscription term, subject to the Safari Terms of Service. Any other use