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: Cs445 — Homework #4 Graphs, MST and Shortest Paths Due: 4/5/2005 during class meeting. All questions have the same weight. Assume that in all graphs discussed in this homework the number of edges is larger than the number of vertices. In all questions the notation  V  denotes the number of elements in the set V . Also assume that that for each graph G ( V, E ) discussed below, each edge ( u, v ) ∈ E is assigned a weight w ( u, v ) which is a real number. In all questions, the length of a path between vertices is the sum of weights of edges along the path, and for two vertices s, v , we denote by δ ( s, v ) the length of the path with minimum weight from s to v . 1. A graph G ( E, V ) is called a cycle graph if there is a path that visits all the edges and all the vertices exactly once, and starts and ends at the same vertex. Suggest an algorithm, as efficient as possible, for finding a Minimum Spanning Tree of a cycle graph....
View
Full
Document
This note was uploaded on 05/27/2008 for the course CS 445 taught by Professor Williams during the Spring '06 term at Arizona.
 Spring '06
 Williams

Click to edit the document details