Site MapHelpFeedbackGraphs, Trees, and Networks
Graphs, Trees, and Networks


CHAPTER OBJECTIVES

1. Define the terms graph and tree for both directed/undirected and weighted/unweighted collections.
2. Compare breadth-first traversal and depth-first traversal.
3. Understand Prim’s greedy algorithm for finding a minimum-cost spanning tree and Dijkstra’s greedy algorithm for finding a minimum-cost path between vertices.
4. Compare the HashMap/LinkedList implementation and the adjacency-matrix implementation of the Network class.
5. Be able to solve problems that include backtracking through a graph.







To learn more about the book this website supports, please visit its Information Center.
(c)2005 McGraw-Hill Higher Education
Any use is subject to the Terms of Use and Privacy Policy.
McGraw-Hill Higher Education is one of the many fine businesses of The McGraw-Hill Companies.


CollinsOnline Learning Center

Home > Chapter 15