![]()  | 
![]()  | 
| 
QGraphi 
 This started as a project for the author's class of Linear Programming; with it you can create/edit/save any graph - in a very simple wysiwyg way - and then solve certain types of problem on it. Currently it solves Minimum Path (Dijkstra) - Maximum Flow (Ford & Fulkerson) and Minimum Cost Flow (Simplex) class of problems. A way to solve TSP (Traveling Salesman Problem) will follow soon. 
  | 
| 
Current Version:   0.30
 License Type: ?? 
  | 
| 
Home Site:
 Source Code Availability: 
Available Binary Packages:
 
 Targeted Platforms: Software/Hardware Requirements: 
  | 
| 
Other Links:
 Mailing Lists/USENET News Groups: User Comments: 
 See A Screen Shot? (Not Yet) 
  | 
SAL Home   
|   
Numerical Analysis   
|   
Optimization