title: I am trying to build a list of limitations of all graph algorithms
body: <pre><code>Single Source shortest Path
  </code></pre>
  
  <p>Dijkstra's - directed and undirected - works only for positive edge weights - cycles ??</p>
  
  <p>Bellman Ford - directed - no cycles should exist</p>
  
  <pre><code>All source shortest path
  </code></pre>
  
  <p>Floyd Warshall - no info</p>
  
  <pre><code>Minimum Spanning Tree 
  </code></pre>
  
  <p>( no info about edge weights or nature of graph or cycles)</p>
  
  <p>Kruskal's</p>
  
  <p>Prim's - undirected </p>
  
  <p>Baruvka's</p>