title: What is the difference between simplex method and network-simplex?
body: <p>I am using the Network Simplex algorithm to solve a Maximum Flow Problem in directed graphs.
  In order to compare the execution time for several routing algorithms, I need to use an implementation of the simplex method by George Dantzig.</p>
  <p><strong>My question is</strong> : Can the Simplex Method solve a maximum flow problem in a given directed graph?</p>
  <p>Is there any good documentation that explains the Simplex Method in graph theory?</p>