Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
90 views

Assignment 3

1. Write pseudocode for an algorithm to determine if an undirected graph G contains a cycle that includes a given edge e. The runtime is O(V+E). 2. Increasing all edge weights in a graph by 1 does not necessarily change the minimum spanning tree or shortest paths from a node s. 3. Determining if statements about minimum spanning trees and shortest paths are true or false.

Uploaded by

Ainan Ihsan
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
90 views

Assignment 3

1. Write pseudocode for an algorithm to determine if an undirected graph G contains a cycle that includes a given edge e. The runtime is O(V+E). 2. Increasing all edge weights in a graph by 1 does not necessarily change the minimum spanning tree or shortest paths from a node s. 3. Determining if statements about minimum spanning trees and shortest paths are true or false.

Uploaded by

Ainan Ihsan
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Assignment No.

3 BESE-1AB

4 Due: assignment July 30, 5pm You can do thisThursdayin groups of 2 students.

Due: Monday 28th April CS161 - Homework

Notes: Many of the algorithms below can be accomplished by either modifying the graph and applying a known algorithm or slightly modifying a known algorithm. Try thinking of these rst as they will save you a lot of work, and writing :) You will be graded on eciency! If not specied in the problem, you may assume whatever graph representation makes your algorithm more ecient (adjacency list or adjacency matrix). State which one you are using. Problems: 1. (5 points) Write pseudocode for an algorithm which, given an undirected graph G and a particular edge e in it, determines whether G has a cycle containing e. What is the runtime of this algorithm? 2. (10 points) Given an undirected graph G with nonnegative edge weights we 0. Suppose you have calculated the minimum spanning tree of G and also the shortest paths to all nodes from a particular node s V . Now, suppose that each edge weight is increased by 1, i.e. the new weights we = we + 1. (a) (5 points) Does the minimum spanning tree change? Give an example where it does or prove that it cannot change. (b) (5 points) Do the shortest paths from s change? Given an example where it does or prove that it cannot change. 3. (12 points) T/F. State whether the following are true or false AND give a brief, but compelling, justication of your answer. Assume graph G is undirected and connected. 1

(a) (3 points) If graph G has more than |V | 1 edges, and there is a unique largest edge, then this edge cannot be part of the MST. (b) (3 points) If G has a cycle with a unique heaviest edge e, then e cannot be part of the MST. (c) (3 points) If the lightest edge in G is unique, then it must be part of every MST. (d) (3 points) The shortest path between two nodes is necessarily part of some MST. 4. (8 points) Often there are multiple shortest paths between nodes of a graph. Write pseudocode for an algorithm that given an undirected, unweighted graph G and nodes u, v V , output the number of distinct shortest paths from u to v. What is the running time? 5. (8 points) Someone suggests to you the following algorithm for nding the shortest distance (sum of edge weights) path from node s to node t in a directed graph with some negative edges: add a large constant to each edge weight so that all the weights become positive, then run Dijkstras algorithm starting at node s, and return the shorted path found to node t. Is this a valid method? Argue that it works correctly or give a counterexample. 6. (8 points) Given a directed graph G = (V, E) with positive edge weights and a particular node vi V , give an ecient algorithm for nding the shortest paths between all pairs of nodes, with the one restriction that these paths must all pass through vi . Give the runtime of your algorithm. Points will be deducted for an inecient algorithm.

7. (5 points) Given the following directed graph specied in adjacency list format: A : B C B : E C : D D : E E: List all of the topological orderings.

Extra Credit
8. (5 points) You have three containers with sizes 10 pints, 7 pints and 4 pints. The 7 and 4 pint containers start out full of water, but the 10 pint container is empty. You are allowed to pour the contents of one container into another until either a) you source container is empty or b) the destination container is full. We want to know if there is a sequence of pourings that leaves exactly 2-pints in either the 7 or 4 pint container. (a) Model this as a graph problem. Describe exactly how to construct the graph and what question about the graph needs to be answered. (b) What algorithm should be applied to this problem?

You might also like