This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: IE 170 Laboratory 7: Graph Search Dr. T.K. Ralphs Due April 3, 2006 1 Laboratory Description and Procedures 1.1 Learning Objectives You should be able to do the following after completing this laboratory. 1. Understand the concept and use of a graph. 2. Understand how to construct a graph and the two basic data structures for storing a graph. 3. Understand how to implement a basic graph search. 4. Understand the importance of object-oriented design and code re-use. 1.2 Key Words You should be able to define the following key words after completing this laboratory. 1. graph 2. vertex 3. edge 4. adjacency list 5. adjacency matrix 6. graph search 7. depth-first search 1.3 Scenario You have been hired by NeverLost, Inc, a designer and retailer of travel maps. As part of their effort to introduce a new custom map service for members of their travel club, they would like to design a data base for storing map data in the form of a graph, from which various information, such as the shortest route between two given cities, could be extracted. Your immediate task is to implement a data structure that could be used to read in and store a list of destination pairs, as...
View Full Document
- Spring '07
- Systems Engineering