shortest paths and lexiographical order


[ Follow Ups ] [ Post Followup ] [ CS328 Message Board ] [ FAQ ]

Posted by ironman on August 11, 2001 at 23:43:15:

in his instructions.txt he says quote:

For each pair A, B of distinct airports (pairs in
lexiographical order), and for each appropriate interval
of starting times (see below), you must describe

1) The "Cheapest" route from A to B:
etc.

when he says for each pair of airports in lexiographical order, does he mean that he's only gonna be looking at a pairs of airports where the departing airport is always alphabetically first?
that would really make things much easier, but it sure dont sound right.


Follow Ups:



Post a Followup

Name:
E-Mail:

Subject:

Comments:

Optional Link URL:
Link Title:
Optional Image URL:


[ Follow Ups ] [ Post Followup ] [ CS328 Message Board ] [ FAQ ]