title: Shortest path algorithm
body: <p>gd morning . .. 
  i made a program to solve dijkstra shortest algorithm . . 
  code is as below :- </p>
  
  <pre><code>#include&lt;iostream.h&gt;
  #include&lt;stdio.h&gt;
  #include&lt;conio.h&gt;
  #define INFINITY 2000
  #define MAXNODES 4
  #define MEMBER 1
  #define NONMEMBER 0
      }
  </code></pre>
  
  <p>and i give input string as 0 
  2
  3
  7
  2
  0
  6
  0
  3
  6
  0
  1
  7
  0
  1
  0</p>
  
  <p>but when i choose starting and final node then it give wrong output . . i don't know where it is . . plz help . . </p>