dijkstra and floyd----- about graphic algorithm

教授布置了一道关于图算法的问题:在一个包含多个村庄的地图上选择一个位置建造医院,要求该位置到最远村庄的距离最短。清华大学出版社的教材中对此问题的解答清晰易懂。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

   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.

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值