用动态规划应该可以实现

METHOD:
1.Read in the graph as the street map;
2.Count out the odd-verteces into the ARRAY [u]odds[/u] and number of odds n;
3.Call [b][i]FLOYD[/i][/b] to calcuate the shortist distance between two odd-  verteces.Record distances into array [u]d[/u] and path into array [u]p[/u];
4.make up a 2-divitioned graph [b]H[/b]. The side-wight is the distances;
5.slove the best match in H.got a add-arcs plan;
6.output it.

楼住自问自答的英语不敢恭维。