[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선

A Distributed Bayesian Spam Filtering using Hadoop Map/Reduce