Please refer to the Tour the T problem on this page. AnalysisThis is an instance of the Traveling Salesman Problem. We can model the entire subway as a weighted graph G=(V,E) where V is a station and E is an edge that connects two stations and w is the weight of the edge that represents the travel time between the two stations. Algorithm
0 Comments
Your comment will be posted after it is approved.
Leave a Reply. 
MeI am a 3D graphics software engineer. Archives
December 2011
Categories
All
