This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Assume: i. The data field consists of a single integer. Turn in a hard copy of your algorithm and code listing, and an electronic copy of your code. 2. What is the Shortest Path through the graph shown below using Dijkstras algorithm? Show all the steps in the computation of the shortest path. b e a c d 1 2 10 5 7 3 2 9 4 6 3. Define the following terms (as applied to graphs): a. Walk b. Path c. Eulerian Path d. Cycle e. Degree of a vertex...
View Full Document
- Fall '05