title: Difference between DIjkstra and BellmanFord algorithm
body: <p>I am wring thesis about shortest path algorithms.
  And i don't understand one thing...<img src="https://i.stack.imgur.com/hNGfS.png" alt="enter image description here"></p>
  
  <p>I have made visualisation of dijkstras algorithm.
  1) Is it correct ? Or am i doing something wrong?
  2) How would look Bellman-Ford algorithm? As fas as i have looked for difference, i found "Bellman-ford: the basic idea is very similar to Dijkstra's, but instead of selecting the shortest distance neighbour edges, it select all the neighbour edges." But also dijkstra checks all vertexes and all edges, isnt it? </p>