版本 5ad2320726f9ac80d01bf8c5aa9c8179060e1150
acm/course/Shortest_Path
Changes from 5ad2320726f9ac80d01bf8c5aa9c8179060e1150 to 8b716419d7c7ab96320b105f367c6d1290ae2a85
Shortest Path ======== Single Source Shortest Path -------- - <big>若使用Backtracking演算法,將枚舉所有路徑,必會TLE,因此我們將列舉幾項好用DER演算法!!</big> ###Relaxation - <big>若點v離source的距離為8、點u離source的距離為3,現在有一個點k,(u,k)長度為2、(k,v)長度為1,則對(u,v)做Relax。Relax後點v離source距離更改為6。</big> ![Relax](/acm/Relax.png) ###Bellman Ford ###SPFA() All Pair Shortest Path --------- ###Floyd