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
- Fall '05
- Graph Theory, Shortest path problem, shortest path