dijkstra and floyd----- about graphic algorithm
i would like to use FLOYD since the first experiment which was hold last week.
The professor gave us a question, about graphic algorithm:
Select a position among a certain number of villages to build a hospital, requesting it's the shortest path between the farthest village and the hospital.
the solvement in our book published by qinghua university is very vivid and easy to learn.