Linear programming vs. Graph Algorithms

From: Bilal Sallakh (afkar_at_mail2world.com)
Date: 01/19/04 

Date: 18 Jan 2004 21:54:52 -0800

Solving a system of difference constraints can be done using graph algorithms much

faster than using the standard Simplex method.

Can any one give me an example of another linear programming problem instance which

can be solved using graph algorithms more efficiently than using the Simplex method?

Regards.