关闭

dijkstra and floyd----- about graphic algorithm

958人阅读 评论(0) 收藏 举报

   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.

0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:245819次
    • 积分:3040
    • 等级:
    • 排名:第11895名
    • 原创:39篇
    • 转载:63篇
    • 译文:0篇
    • 评论:42条
    文章分类
    最新评论