GIDEN is an interactive software environment designed to facilitate the visualization of network optimization problems, solutions, and algorithms. (Screen shots of the GIDEN software are available here.) Features of GIDEN include the following:

• a graphical interface for building and modifying networks
• facilities for algorithm animation
• an expandable toolkit of animated algorithm implementations ("solvers")
• a library of network-related data structures
• platform independence

• minimum spanning tree problem
• shortest path problem
• maximum flow problem
• minimum-cost flow problem

Network Flows: Theory, Algorithms, and Applications
Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin
Prentice Hall (1993)
ISBN 0-13-617549-X

GIDEN: This is the current version of GIDEN, which is available as a Java application. The software can be used on any Java-enabled computing platform with an available Java virtual machine (see FAQ for more info). Screen shots of the GIDEN software are available here.

GIDEN 1.0 Demo: For users who prefer a web interface, we are providing an older (October 1997) applet version of the GIDEN software. Please note that we do not support this version of GIDEN, which is substantially different from the current release.

The GIDEN project team was organized through the Industrial Engineering and Management Sciences Department at Northwestern University. The primary participants are

The development team gratefully acknowledges essential support for the GIDEN project from the following organizations:

Several other individuals have contributed to the project through their substantial testing efforts or through comments and suggestions that have resulted in the improvement of GIDEN. We are particularly grateful to the following individuals: Rosemary Berger, Robert Fourer, Peh Ng, Susan Owen, and Donald Wagner.

Please email any comments or questions to: