看板 Grad-ProbAsk 關於我們 聯絡資訊
※ 引述《boy5548 (小YO)》之銘言: : 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...百思不得其解阿@@ 考慮這種狀況 4 s-------t | | 1| |1 | | --------- 1 都增加1 狀況就會改變了 -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 125.231.215.193
boy5548:喔喔 OK 謝謝:) 02/05 17:39
wsxxsw13:cool~ 02/12 21:58