title: Dijkstra with Parallel edges and self-loop
body: <p>If I have a weighted undirected Graph with no negative weights, but can contain multiple edges between vertex and self-loops, Can I run Dijkstra algorithm without problem to find the minimum path between a source and a destination or exists a counterexample? 
  <a href="https://i.stack.imgur.com/ANlMT.jpg" rel="noreferrer"><img src="https://i.stack.imgur.com/ANlMT.jpg" alt="graph"></a></p>
  
  <p>My guess is that there is not problem, but I want to be sure. </p>