title: Dijkstra's algorithm a greedy or dynamic programming algorithm?
body: <p>In <a href="https://stackoverflow.com/questions/6162465/divide-and-conquer-dynamic-programming-and-greedy-algorithms">this post</a> it is described Dijkstras as a greedy algorithm, while <a href="http://matwbn.icm.edu.pl/ksiazki/cc/cc35/cc3536.pdf" rel="noreferrer">here</a> and <a href="http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#Dynamic_programming_perspective" rel="noreferrer">here</a> it is shown to have connections with dynamic programming algorithms. </p>
  
  <p>Which one is it then?</p>