[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

경희대 강연자료

How socket.io-redis adapter works? 레디스 어댑터 동작원리