which is the best algorithm(time complexity) to find the shortest path
<p>I have an
<a href="http://i.stack.imgur.com/LjeyR.jpg" rel="nofollow">adjacency matrix</a> . I have to calculate shortest + alternate path: </p>

<ol>
<li>from one vertex (A) to another vertex (B)</li>
<li>from all vertices to single vertex</li>
<li>of a pair of vertices </li>
<li>from every vertex every other vertex</li>
</ol>

<p>I have to calculate all these using graph algorithms (dijkstra, BellManford, BFS). Can anyone suggest me which will be the best* algorithm to implement these.</p>

<p>*best means least time; complexity</p>