This example graph with 213 nodes and 269 edges represents dependencies between modifications to a large program. Testing such programs is tedious and expensive. The graph layout computed by aiSee helps to find out which subsets of modifications might be tested separately after understanding or even eliminating a few key dependencies. In so doing, considerable effort and precious engineering resources can be saved.

Last modified on 25 April 2003 by webmaster. © 2002-2003 AbsInt.
URL: http://www.aisee.com/gallery/graph2.htm

Home
About

 Examples
» GDL files
» SVG output
» PNG output
» HTML output
» PS output
» Applications
» Output split
» Animations
» Search

Free trial
Support
Store
Legal
Contact
Extras
Sitemap