title: Getting shortest path between 2 nodes in quickgraph
body: <p>i want to ask if there is any way to generate the shortest path from node A to node B
  without generating the shortest paths to all the other nodes (stop when node B is in the examined set)
  with A-star in QuickGraph.</p>
  
  <p>I want to plug QuickGraph into a game and thus generating all the paths is not allowed from the time
  limitations the environment imposes.</p>
  
  <p>Any other suggestions to solve my problem in C# are welcome</p>
  
  <p>Thanks in advance,
  Xtapodi</p>