推 tureday:假如path：1+1+1+1＝4是最短路徑P,另一條2+3＝5不是最短 02/05 17:38
→ tureday:全都+1..P的值變成2+2+2+2＝8..另一條3+4＝7反而是最短 02/05 17:39
→ boy5548:嗯嗯 了解了 謝謝:) 02/05 17:40
Let P be the shortest path from some vertex s to some other vertex t in
graph.If the weight of each edge in graph is increased by one, P remains a
shortest path from s to t.
請問這題為什麼是Fasle...百思不得其解阿@@
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 114.39.3.225