[Note] Dijkstra's vs. Bellman-Ford

  • Dijkstra's : relax each edge exactly once (can't handle negative weights)
  • Bellman-Ford : relax each edge |V| -1 times

Anything else?

Comments

Popular posts from this blog

일본만화 추천 100선

구글링하는(googling) 방법

AWS re:Invent 2017 참관기