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.
Be the first to post a text review of The Figaro. Rate and review a project by clicking thumbs up or thumbs down in the right column.
18.1.2005, Daniel Sawitzki (daniel.sawitzki@gmx.de) Changes from Version 1.0.7 to 1.1.0 - Fixed some bugs. - Added the class IntListObject for exchanging integer lists between generators and algorithms. - Added a visualization for the class StringObject. - Added an implicit scheduling algorithm. - Added a generator for scheduling problems. Changes from Version 1.0.6 to 1.0.7 - Fixed some minor bugs. - Added implicit shortest-path algorithms. Changes from Version 1.0.5 to 1.0.6 - Fixed some minor bugs. - All explicit graphs are now handled in the GML format. - The generator for threshold functions now uses arbitrary precision integers to manage threshold values. - Added some features to the Implicit TFC Network Generator. - Added an Implicit Blow Network Generator, which creates explicit random graphs and turns them into implicit, large graphs by replacing original edges by layers of complete bipartite graphs. Changes from Version 1.0.4 to 1.0.5 - Fixed some minor bugs. Changes from Version 1.0.3 to 1.0.4 - Fixed some minor bugs. - Changed some internals of the StatBDD class. - Added a generator for functions composed of threshold functions. - Added a generator for time-expanded networks. - Added a converter that computes flows over time from static flows in time-expanded networks. - Added a maximum flow algorithm that avoids breadth first searches by using iterative squaring. Changes from Version 1.0.2 to 1.0.3 - Made the BDD visualization more flexible to use an arbitrary number of encoding OBDD variables. - Changed some internals of the StatBDD class. - Added an alternate quantification method that is realized by binary synthesis operations. - Experiments are now saved before a non-gui run is aborted by a signal. Changes from Version 1.0.1 to 1.0.2 - Fixed some minor bugs in the KDevelop project file. - Changed time measuring from real time to CPU time. The CPU time is calculated as the sum of - the time spent executing user instructions. - the time spent in operating system code on behalf of the figaro process. Real time measuring can still be activated by adding '-DFIGARO_REALTIME' to the CPPFLAGS (see the INSTALL file). Changes from Version 1.0 to 1.0.1 - Fixed a bug in plugin ImplicitTestNetworkGenerator. When using certain parameters N and M, the calculated upper bound for the number of network nodes was too low. This resulted in the generation of too less encoding OBDD variables.
5.2.2004, Daniel Sawitzki (daniel.sawitzki@gmx.de) Changed from Version 1.0.6 to 1.0.7 - Fixed some minor bugs. - Added implicit shortest-path algorithms. Changes from Version 1.0.5 to 1.0.6 - Fixed some minor bugs. - All explicit graphs are now handled in the GML format. - The generator for threshold functions now uses arbitrary precision integers to manage threshold values. - Added some features to the Implicit TFC Network Generator. - Added an Implicit Blow Network Generator, which creates explicit random graphs and turns them into implicit, large graphs by replacing original edges by layers of complete bipartite graphs. Changes from Version 1.0.4 to 1.0.5 - Fixed some minor bugs. Changes from Version 1.0.3 to 1.0.4 - Fixed some minor bugs. - Changed some internals of the StatBDD class. - Added a generator for functions composed of threshold functions. - Added a generator for time-expanded networks. - Added a converter that computes flows over time from static flows in time-expanded networks. - Added a maximum flow algorithm that avoids breadth first searches by using iterative squaring. Changes from Version 1.0.2 to 1.0.3 - Made the BDD visualization more flexible to use an arbitrary number of encoding OBDD variables. - Changed some internals of the StatBDD class. - Added an alternate quantification method that is realized by binary synthesis operations. - Experiments are now saved before a non-gui run is aborted by a signal. Changes from Version 1.0.1 to 1.0.2 - Fixed some minor bugs in the KDevelop project file. - Changed time measuring from real time to CPU time. The CPU time is calculated as the sum of - the time spent executing user instructions. - the time spent in operating system code on behalf of the figaro process. Real time measuring can still be activated by adding '-DFIGARO_REALTIME' to the CPPFLAGS (see the INSTALL file). Changes from Version 1.0 to 1.0.1 - Fixed a bug in plugin ImplicitTestNetworkGenerator. When using certain parameters N and M, the calculated upper bound for the number of network nodes was too low. This resulted in the generation of too less encoding OBDD variables.
Changes from Version 1.0.5 to 1.0.6 - Fixed some minor bugs. - All explicit graphs are now handled in the GML format. - The generator for threshold functions now uses arbitrary precision integers to manage threshold values. - Added some features to the Implicit TFC Network Generator. - Added an Implicit Blow Network Generator, which creates explicit random graphs and turns them into implicit, large graphs by replacing original edges by layers of complete bipartite graphs.
Be the first person to add a text review.
Copyright © 2009 Geeknet, Inc. All rights reserved. Terms of Use
Thanks for your rating!
Would you also like to write a review?