Data Structures
Weighted Graph Applications Demonstration
Look at Figure 29.23 which illustrates a weighted graph with 6 verticies and 8 weighted edges.
Simply provide:
- Minimal Spanning Treeas an illustration or a textual list of edges (in our standard vertex order).
- Single-Source Shortest Pathroute from vertex 0 to the other 5 (described as one path/route for each).
You may draw the two solutions and attach the illustration or describe them in text (a list of edges for the one and the vertex to vertex path the other).
Be sure the final trees or path lists are clearly visible in your solution.
Extracted text: 100 1 File 3 20 6 0, 1, 100 | 0, 2, 3 1, 3, 20 40 2, 3, 40 | 2, 4, 2 5 3, 4, 5 | 3, 5, 5 5 4, 5, 9 5 (a) (b) 3. 2. 2.