Homework_3

Homework_3 - added to G Problem 4: Suppose you are given an...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Homework 3 Problem 1: Show an example where Dijkstra’s algorithm fails. Problem 2: Run Dijkstra’s algorithm manually for the following graph. (A as a source) Problem 3: Suppose that a graph G has a minimum spanning tree already computed. How quickly can the minimum spanning tree be updated if a new vertex and incident edges are
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: added to G Problem 4: Suppose you are given an undirected graph G , with edge weights that you may assume are all distinct. G has n vertices and m edges. A particular edge e of G is specified. Given an algorithm with running time O ( m + n ) to decide whether e is contained in a minimum weight spanning tree of G ....
View Full Document

This note was uploaded on 08/15/2008 for the course CSCI 570 taught by Professor Shamsian during the Spring '06 term at USC.

Ask a homework question - tutors are online