This preview shows pages 1–3. 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: Chapter 12 2. Draw the adjacency list of the graph. Answer: [0 ] 1 2 3 [1 ] 4 [2 ] 1 4 [3 ] [4 ] [5 ] 1 3 6. Consider the graph. Find the shortest distance from node 0 to every other node in graph. Answer: 1 w = 3 4 w = 10 2 w = 8 5 w = 15 3 w = 4 8. Find the spanning tree in graph. Answer : CS 270 11. Describe whether the graph has Euler circuit. If it does, find the circuit? Answer : The graph doesnt have Euler circuit because it has vertices with odd degrees. (vertex 2) Chapter 13 10. Suppose that the intList is a vector container and: intList = {2,4,6,8,10,12,14,16} What is the value of the result after this statement executes? Answer : 72...
View
Full
Document
This note was uploaded on 01/19/2011 for the course CS 270 taught by Professor None during the Spring '10 term at Grantham.
 Spring '10
 NONE

Click to edit the document details