hdu2680choose专题

hdu2680Choose the best route (spfa算法,加个以0点为起点到每个起点,只要一遍就能算出,不然要算k次)

Problem Description One day , Kiki wants to visit one of her friends. As she is liable to carsickness , she wants to arrive at her friend’s home as soon as possible . Now give you a map of the city