title: Java - Find shortest path between 2 points in a distance weighted map
body: <p>I need an algorithm to find shortest path between two points in a map
  where road distance is indicated by a number.</p>
  
  <p>what is given:
  Start City A
  Destination City Z</p>
  
  <p>List of Distances between Cities:</p>
  
  <p>A - B : 10<br/>
  F - K : 23<br/>
  R - M : 8<br/>
  K - O : 40<br/>
  Z - P : 18<br/>
  J - K : 25<br/>
  D - B : 11<br/>
  M - A : 8<br/>
  P - R : 15<br/> </p>
  
  <p>I thought I could use Dijkstra's algorithm , however it finds shortest distance to all destinations. not just one.</p>
  
  <p>Any suggestion is appreciated.</p>