Unformatted text preview: you have a good map in front of you, it takes quite a while to compute the shortest path requests since the campus is large with many points of interest. You would like to prepare for these requests in advance. You ﬁnd a big ball of string, a precise ruler, and a pair of scissors along with the book “Teach Yourself the Art of Knots” in the booth, and you suspect these might help to solve your problem. How? You can assume that all roads on campus are two-way. (Hint: Think about ﬁrst building a “string model” of the road system on campus . ..) Would the same approach work if some of the roads were one-way?...
View Full Document
- Fall '05
- Shortest path problem, shortest path, shortest path tree, Engineering Library