title: Source algorithm for networkx shortest_path(G[, source, target, weight]) function
body: <p>I am doing some work with networkx and have used two shortest path algoritms namely:</p>
  
  <pre><code> shortest_path(G[, source, target, weight]) 
   dijkstra_path(G, source, target[, weight])
  </code></pre>
  
  <p>I understand that the  <code>dijkstra_path(G, source, target[, weight])</code> function is based on the dijkstra's shortest path algorithm. I would like to know the source algorithm upon which the <code>shortest_path(G[, source, target, weight])</code> function is based. I need it because I have to report about the algorithms I have used. I have searched some stackoverflow pages like <a href="https://stackoverflow.com/questions/9430027/networkx-shortest-path-length">Networkx - Shortest path length</a> and
  <a href="https://stackoverflow.com/questions/16550292/all-shortest-paths-for-weighted-graphs-with-networkx">All shortest paths for weighted graphs with networkx?</a> but they don't quite answer my question, I have also look closely at the networkx documentation and other articles on google and haven't gotten found an answer. Can someone please help me with this information. Thank you</p>