PreLab2

# PreLab2 - 2-way.” More precisely the input consists of an...

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

ENGRI 1101 Engineering Applications of OR Fall 2008 Prelab 2 The Shortest Path Problem Name: Objectives: Introduce students to the concept of a shortest path tree Show students the inner workings of a combinatorial algorithm Demonstrate the usefulness of sensitivity analysis in problem solving Show students that we use crude optimization algorithms in our everyday lives Demonstrate the concept of the triangle inequality Key Ideas: Shortest path Dijkstra’s Algorithm Shortest path tree Triangle inequality Sensitivity analysis Combinatorial optimization Reading Assignment: Read Handout 3 on the shortest path problem. Prelab exercise: Please write your answer on the back of this sheet. Suppose that you are given a data set for the shortest path problem in which “all of the streets are
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 2-way.” More precisely, the input consists of an undirected graph, where each undirected edge ij has a given length ℓ ( ij ) ≥ 0 , so that the distance from node i to j is always the same as the distance from node j to i . You are given a large quantity of string, a very precise ruler, and a pair of scissors. You are also an expert at making knots (or if not, you have been given a good book telling you how). How can you use the material in order to compute the shortest path between to nodes in this graph? (Think about Frst building a “string model” of your graph.) Would the same approach work if the input were a directed graph? 1...
View Full Document

## This note was uploaded on 09/30/2008 for the course ENGRI 1101 taught by Professor Trotter during the Fall '05 term at Cornell.

Ask a homework question - tutors are online