HW#14 : Dijkstra's Algorithm 최적임의 증명HW#14 : Dijkstra's Algorithm 최적임의 증명

Posted at 2011. 5. 3. 02:34 | Posted in Computer Science/알고리즘

HW#14 : Dijkstra's Algorithm for Single Source Shortest Path Problem은 Greedy Method이면서 최적인 이유는 무엇인가?(Optimality Proof)

Name __

Password __

Link (Your Website)

Comment

SECRET | 비밀글로 남기기