Java Reference
In-Depth Information
CHAPTER
29
W EIGHTED G RAPHS
AND A PPLICATIONS
Objectives
To represent weighted edges using adjacency matrices and adjacency
lists (§29.2).
To model weighted graphs using the WeightedGraph class that
extends the AbstractGraph class (§29.3).
To design and implement the algorithm for finding a minimum
spanning tree (§29.4).
To define the MST class that extends the Tree class (§29.4).
To design and implement the algorithm for finding single-source
shortest paths (§29.5).
To define the ShortestPathTree class that extends the Tree class
(§29.5).
To solve the weighted nine tails problem using the shortest-path
algorithm (§29.6).
 
 
Search WWH ::




Custom Search