The "Framework for Implicit Graph Algorithms and Representations by OBDDs" (Figaro) automatically manages experiments with input generator and algorithm plugins. It already contains some generators and algorithms for graph and scheduling problems.
|Tags||Scientific/Engineering Software Development education|
|Operating Systems||POSIX Linux Solaris|
Release Notes: This release fixes some bugs, and adds the class IntListObject for exchanging integer lists between generators and algorithms, a visualization for the class StringObject. an implicit scheduling algorithm. and a generator for scheduling problems.
Release Notes: Some minor bugs have been fixed. Implicit shortest-path algorithms have been added.
Release Notes: Some minor bugs were fixed. All explicit graphs are now handled in the GML format. The generator for threshold functions now uses arbitrary precision integers to manage threshold values. Some features were added to the Implicit TFC Network Generator, and an Implicit Blow Network Generator was added, which creates explicit random graphs and turns them into implicit, large graphs by replacing original edges by layers of complete bipartite graphs.
No changes have been submitted for this release.
Release Notes: Some minor bugs were fixed. Some internals of the StatBDD class were changed. A generator for functions composed of threshold functions was added. A generator for time-expanded networks was added. A converter that computes flows over time from static flows in time-expanded networks was added. A maximum flow algorithm that avoids breadth first searches by using iterative squaring was added.