4c865baeb042a5c1a066759a234bdb0ccd7832f8
[libdai.git] / ChangeLog
1 git master
2 ----------
3 * [Arman Aksoy] Added Makefile.MACOSX64
4 * Fixed bug in findMaximum (it only considered a single connected component of the factor graph)
5 * [Benjamin Piwowarski] Renamed "foreach" macro into "bforeach" to avoid conflicts with newer Boost library versions
6 * Optimized ClusterGraph( const FactorGraph&, bool) constructor
7 * Fixed "typename" bug in src/alldai.cpp which resulted in FTBFS for older g++ compilers
8 * Fixed memory leak in alldai.cpp and removed the function builtinInfAlgs()
9 * Fixed memory leak in CBP::run()
10 * Fixed typo in Priya's name
11
12
13 libDAI-0.3.0 (2011-07-12)
14 -------------------------
15
16 New license:
17 * Changed license from GPL v2+ to FreeBSD (BSD 2-clause)
18
19 Miscellaneous improvements:
20 * Improved Exception class
21 (it now stores more information and doesn't print to stderr by default)
22 * Added builtinInfAlgs() and builtinInfAlgNames()
23
24 Bug fixes:
25 * [Laurens van der Maaten] src/matlab/dai.cpp now correctly handles missing logZ()
26 and maxDiff() implementations
27 * Now uses GMP big integer type to represent linear states and the number of
28 states of VarSets (in some cases). This fixes a bug Jerome Maye and Priya
29 found in the State class. Unfortunately, the supplied Makefile.WINDOWS now
30 no longer works out-of-the-box.
31 * Fixed numerical issues in MF, FBP and TRWBP (discovered in sparse branch)
32 * Fixed bug in findMaximum(): inconsistent max-beliefs are now detected,
33 instead of returning a MAP state with zero joint probability
34 (reported by Hynek Urban)
35 * Fixed a Boost-related bug in src/util.cpp (reported by Avneesh Saluja)
36 (the random seed needs to be an unsigned int on some platforms)
37 * Fixed two bugs in examples/example_sprinkler_gibbs (reported by Priya)
38 * Fixed bug in tokenizeString() and Evidence::addEvidenceTabFile()
39 (a tab character at the end of a line was incorrectly discarded - bug reported by Priya)
40 * Replaced all Name members by name() virtual functions and removed global variable DAINames
41 (this fixes a bug in matlab/dai.cpp reported by Thomas Mensink)
42
43
44 libDAI-0.2.7 (2010-08-19)
45 -------------------------
46
47 * Removed interfaces deprecated in 0.2.6.
48 * Fixed a bug in JTree::findMaximum() (reported by zhengyun84 and Dhruv Batra):
49 if one or more variables had a MAP belief with more than one maximum, an
50 incorrect MAP state could result.
51
52
53 libDAI-0.2.6 (2010-08-05)
54 -------------------------
55
56 New features:
57 * Added decimation algorithm DecMAP for MAP inference (decmap.h/cpp).
58 * Added source code for one of the winning solvers of the
59 UAI 2010 Approximate Inference Challenge (examples/uai2010-aie-solver.cpp).
60 * Added support for reading files in the UAI Approximate Inference Challenge
61 format, supporting both the 2006/2008 evidence file format and the 2010
62 evidence file format (io.h/cpp).
63
64 Miscellaneous improvements:
65 * 'maxtime' property added to various algorithms (BP, Gibbs, HAK, TreeEP)
66 for setting an upper limit on execution time.
67 * 'maxmem' property added to JTree for setting an upper limit on memory usage.
68 * SmallSet:
69 - Added SmallSet::erase( const T& t ).
70 * VarSet:
71 - nrStates() now returns a long double instead of a size_t.
72 * Permute:
73 - Added ranges() accessor.
74 - Added inverse() method.
75 - Added optional reverse argument to Permute( const std::vector<Var>& ) constructor.
76 * Factor:
77 - Added createFactorDelta( const VarSet& vs, size_t state ).
78 * ClusterGraph:
79 - Added ClusterGraph(const FactorGraph& fg, bool onlyMaximal) constructor.
80 - Added findCluster( const VarSet& cl ).
81 - Added elimVar( size_t i ).
82 - Added 'maxStates' argument to VarElim( EliminationChoice f, size_t maxStates=0 ).
83 * FactorGraph:
84 - Added isMaximal(size_t).
85 - Added maximalFactor(size_t).
86 - Added FactorGraph::logScore( const std::vector<size_t>& statevec ).
87 * Gibbs:
88 - Added 'restart' property.
89 - Added Gibbs::findMaximum() for MAP inference.
90 * HAK:
91 - Optimized region graph construction for HAK/GBP with clusters=BETHE.
92 * examples/examples_imagesegmentation.cpp:
93 - [Peter Rockett] Improved Makefiles for image segmentation example.
94 - Added build flag to specify the CImg version.
95 * util.h/cpp:
96 - Added fromString<>( const std::string& x ).
97
98 Interface changes (the old interface is marked obsolete and will be removed in the next release):
99 * Added InfAlg::setMaxIter(size_t) for setting the maximum number of iterations.
100 * Deprecated Graph::Neighbor, BipartiteGraph::Neighbor and DAG::Neighbor
101 and replaced them by a globally defined Neighbor structure
102 * Deprecated Graph::Neighbors, BipartiteGraph::Neighbors and DAG::Neighbors
103 and replaced them by a globally defined Neighbors type
104 * Deprecated Graph::Edge, BipartiteGraph::Edge and DAG::Edge
105 and replaced them by a globally defined Edge type
106 * Renamed 'iters' property of Gibbs algorithm into 'maxiter'.
107 * ClusterGraph::findVar( const Var& n ) no longer throws an exception if the
108 variable is not found.
109 * Deprecated 'void tokenizeString( const string&, vector<string>&, const string& )'
110 and replaced it with an improved version
111 'vector<string> tokenizeString( const string&, bool, const string& )'
112 * Removed interfaces deprecated in 0.2.5.
113
114 Bug fixes:
115 * Fixed a problem with isnan() on FreeBSD; it is now in the dai namespace.
116 * Workaround for older g++ compilers (e.g. version 4.0.0 on Darwin 9.8.0)
117 which have problems when comparing const_reverse_iterator with
118 reverse_iterator.
119 * [Matt Dunham] Fixed a bug in Factors2mx in src/matlab/matlab.cpp
120 (segfault if factors depending on 0 variables were passed to MatLab)
121
122
123 libDAI-0.2.5 (2010-05-09)
124 -------------------------
125
126 New features:
127 * Added unit tests for var, smallset, varset, graph, dag, bipgraph,
128 weightedgraph, enum, util, exceptions, properties, index, prob,
129 factor, factorgraph, clustergraph, regiongraph, daialg, alldai
130 * [Ofer Meshi] Added a script for converting from FastInf to libDAI format
131 * Added utils/uai2fg, a utility to convert the UAI inference competition file
132 formats to the libDAI factor graph file format
133 * Added dag.h/cpp, an implementation of Directed Acyclic Graphs
134 * Added examples/example_imagesegmentation
135
136 Miscellaneous improvements:
137 * TRWBP:
138 - Added initialization of TRWBP weights by sampling spanning trees
139 * MF:
140 - Added an "init" option that allows to initialize randomly
141 - Added an "updates" option that allows to choose between standard
142 mean field and "hard-spin" mean field
143 * MR:
144 - rewrote response propagation implementation with help of BBP
145 - now uses GraphAL to represent the Markov graph
146 - miscellaneous smaller cleanups
147 * TreeEP:
148 - Now also supports disconnected factor graphs
149 * JTree:
150 - Now also supports disconnected factor graphs
151 * ExactInf:
152 - Added findMaximum()
153 * RegionGraph:
154 - Added error checking code
155 - Changed the way a RegionGraph is streamed to an std::ostream.
156 * ClusterGraph:
157 - Added nrVars() method
158 - Added var( size_t ) method
159 - Added cluster( size_t ) method
160 * FactorGraph:
161 - clamped() now contains a delta factor for the clamped variable
162 - Added MarkovGraph()
163 * TFactor:
164 - Added takeAbs()
165 - Added takeExp()
166 - Added takeLog( bool )
167 - Added operator-() const
168 - Added sumAbs() const
169 - Added operator==( const TFactor<T> &y )
170 - Added get(size_t), set(size_t,T)
171 * TProb:
172 - Added operator==( const TProb<T> &q )
173 - accumulate() now also applies op2 to init
174 - operator/= (T x) now yields 0 when dividing by 0
175 - Added resize(size_t)
176 - Added get(size_t) and set(size_t,T)
177 - Changed format of TProb<T> when streamed to an ostream
178 * multifor:
179 - Added reset()
180 * PropertySet:
181 - Added size()
182 - Added clear()
183 - Added erase()
184 * util.h/cpp:
185 - Added std::string toString( const T& x )
186 * weightedgraph.h/cpp:
187 - Added option to MaxSpanningTree and MinSpanningTree for
188 choosing between Prim's algorithm and Kruskal's algorithm
189 - Better error checking in RootedTree constructor
190 - Added GraphEL::GraphEL( const GraphAL& G ) constructor
191 * BipartiteGraph:
192 - Added hasEdge()
193 - Added findNb1()
194 - Added findNb2()
195 - Added nb1Set()
196 - Added nb2Set()
197 - Added operator==( const BipartiteGraph& )
198 - Added BipartiteGraph( size_t nr1, size_t nr2 ) constructor
199 - Added operator<<( std::ostream&, const BipartiteGraph& )
200 * GraphAL:
201 - Added hasEdge(size_t,size_t)
202 - Added nbSet(size_t)
203 - Added operator==( const GraphAL& )
204 - Added operator<<( std::ostream&, const GraphAL& )
205 * SmallSet:
206 - Added insert( const T& t ) method
207 * Improved regression test
208 * Made all "verbose" properties optional
209 * utils/createfg now has a new factor type ('ISINGUNIFORM') and the old
210 'ISING' factor type has been renamed to 'ISINGGAUSS'
211 * tests/testdai option "marginals" now has five possible values: NONE
212 outputs no marginals, VAR only variable marginals, FAC only factor
213 marginals, VARFAC both types of marginals, and ALL outputs all
214 marginals calculated by the algorithm.
215 * Compressed Makefile
216
217 Interface changes (the old interface is marked obsolete and will be removed in the next release):
218 * Removed RandomDRegularGraph(), please use createGraphRegular() instead
219 * TreeEP:
220 - Changed construct( const RootedTree& ) into
221 construct( const FactorGraph&, const RootedTree& )
222 * JTree:
223 - Changed construct( const std::vector<VarSet>&, bool ) into
224 construct( const FactorGraph&, const std::vector<VarSet>&, bool )
225 - Changed GenerateJT( const std::vector<VarSet> & )
226 into GenerateJT( const FactorGraph &, const std::vector<VarSet> & )
227 * RegionGraph:
228 - Made (previously public) members G, ORs, IRs and fac2OR protected and
229 added DAG() accessor which returns a reference to the region graph DAG
230 structure (currently implemented as a BipartiteGraph).
231 - Renamed calcCountingNumbers() into calcCVMCountingNumbers() and made it
232 protected, because exposing it to the world serves no purpose.
233 - Removed partial constructor RegionGraph( const FactorGraph& fg )
234 - Made RecomputeORs(), RecomputeORs( const VarSet& ) and RecomputeOR( size_t )
235 protected and renamed them by changing the "Recompute" into "recompute",
236 because exposing them to the world serves no purpose.
237 * ClusterGraph:
238 - Made (previously public) members G, vars and clusters private and added
239 bipGraph(), vars() and clusters() methods which offer read-only access
240 to these members.
241 - Deprecated toVector()
242 - Renamed size() into nrClusters()
243 * FactorGraph:
244 - Renamed Cliques() into maximalFactorDomains() and made it faster
245 - findVars( const VarSet& ) now returns a SmallSet<size_t>
246 and its argument now has a const-qualifier (which fixes a small bug).
247 - Made (previously public) member G private and added the
248 bipGraph() method, which offers read-only access to it.
249 - Deprecated the iterator interface:
250 o FactorGraph::iterator typedef
251 o FactorGraph::const_iterator typedef
252 o FactorGraph::begin() members
253 o FactorGraph::end() members
254 - Deprecated factor(size_t) which offered write access to a factor
255 because using this functionality in the descendant RegionGraph is dangerous,
256 as the outer regions are not automatically recomputed.
257 * TFactor:
258 - Renamed states() into nrStates()
259 - Added get(size_t) and set(size_t,T) operators;
260 get() is equivalent to "operator[](size_t) const" and set() should
261 be used instead of the non-const operator[], which has been deprecated
262 * TProb:
263 - Deprecated TProb( TIterator begin, TIterator end, size_t sizeHint=0 )
264 constructor: the sizeHint argument no longer defaults to 0
265 - Deprecated accumulate( T init, binOp op1, unOp op2 );
266 instead, accumulateSum( T init, unOp op ) and
267 accumulateMax( T init, unOp op, bool minimize ) should be used.
268 - Deprecated TProb::NormType and TProb::DistType;
269 ProbNormType and ProbDistType should be used instead.
270 - Fixed bug by renaming operator<=() to operator<()
271 - Added get(size_t) and set(size_t,T) operators;
272 get() is equivalent to "operator[](size_t) const" and set() should
273 be used instead of the non-const operator[], which has been deprecated
274 * PropertySet:
275 - Renamed Set() -> set()
276 - Renamed Get() -> get()
277 - Renamed GetAs<T>() -> getAs<T>()
278 - Renamed ConvertTo<T>() -> convertTo<T>()
279 * util.h/cpp:
280 - Removed max( const std::vector<Real> &v )
281 * weightedgraph.h/cpp:
282 - Renamed MaxSpanningTreePrims into MaxSpanningTree
283 - Renamed MinSpanningTreePrims into MinSpanningTree
284 - The vertices in DEdge and UEdge are now named "first" and "second"
285 for compatibility with a std::pair<size_t,size_t>
286 * BipartiteGraph:
287 - delta1() and delta2() now return a SmallSet<size_t> instead of a vector<size_t>
288 * SmallSet:
289 - The sizeHint argument of the iterator constructor
290 SmallSet::SmallSet( TIterator begin, TIterator end, size_t sizeHint=0 )
291 no longer has a default value in order to avoid confusion with the
292 SmallSet::SmallSet( const T &t1, const T &t2 )
293 constructor.
294
295 Bug fixes:
296 * [Stefano Pellegrini] Fixed bug in JTree::findMaximum()
297 * [Stefano Pellegrini] Fixed bug in BP[logdomain=1,inference=MAXPROD]
298 * Fixed some bugs in the MatLab interface build system
299 * Fixed a bug in utils/fginfo.cpp
300 * Fixed a bug in JTree::findMaximum() and simplified the code
301 * Fixed bug in BBPCostFunction::operator=() which prevented the desired
302 assignment from happening
303 * RegionGraph::WriteToFile( const char* ), RegionGraph::ReadFromFile( const char * )
304 and RegionGraph::printDot( std::ostream& ) incorrectly called their respective
305 FactorGraph ancestor methods; this has been corrected by letting them throw a
306 NOT_IMPLEMENTED exception.
307 * Fixed bug in FactorGraph::clone()
308 * Fixed bug in min( const TFactor<T> &, const TFactor<T> & )
309 * Fixed bug in max( const TFactor<T> &, const TFactor<T> & )
310 * Fixed bug by renaming TProb<T>::operator<=() to TProb<T>::operator<()
311 * Fixed bug in PropertySet::setAsString<T>()
312 * Fixed a bug in rnd_seed()
313 * BipartiteGraph:
314 - Fixed bug in eraseNode1()
315 - Fixed bug in eraseNode2()
316 - Fixed bug in isTree()
317 * GraphAL:
318 - Fixed bug in nrEdges()
319 - Fixed bug in addEdge()
320 - Fixed bug in isTree()
321 - Fixed bug in eraseNode()
322 - Fixed bug in printDot()
323 * Fixed bug in createGraphGrid3D()
324 * Fixed bug in createGraphRegular()
325
326
327 libDAI-0.2.4 (2010-02-11)
328 -------------------------
329
330 New features:
331 * Implemented Tree-Reweighted BP
332 * [Frederik Eaton] Implemented Fractional Belief Propagation
333
334 Miscellaneous improvements:
335 * Improved documentation
336 * [Frederik Eaton] Added constructors for BBPCostFunction
337 * [Frederik Eaton] Added accessor/mutator for the elements of a SmallSet<>
338 * [Frederik Eaton] Added unary minus to TProb<>
339 * [Frederik Eaton] Added Hellinger distance to TProb<>::DistType
340 * [Frederik Eaton] Two small patches for src/jtree.cpp and utils/createfg.cpp
341 * tests/testdai option "marginals" now has three possible values: NONE
342 outputs no marginals, VAR only variable marginals, and ALL outputs all
343 marginals calculated by the algorithm.
344 * Strengthened convergence criteria of various algorithms
345 * Added GraphAL, an adjacency list implementation for graphs,
346 similar to (but simpler than) BipartiteGraph
347 * Added some functionality to create various standard factors
348 (the functions whose names start with "createFactor")
349 * Added examples example_sprinkler_gibbs and example_sprinkler_em
350 * Implemented various heuristics for choosing a variable elimination sequence
351 in JTree
352 * Added BETHE method for GBP/HAK cluster choice
353 * Made alias support official part of the library
354
355 Build system:
356 * Moved platform independent build options into Makefile.ALL
357 * Windows platform now needs Boost 1.37 or higher
358
359 Code cleanup:
360 * Cleaned up utils/createfg and tests/testdai
361 * Cleanup of some duplicate code in BP, FBP, TRWBP
362
363 Interface changes (the old interface is marked obsolete and will be removed in the next release):
364 * Removed obsolete/deprecated stuff
365 * Renamed Graph into GraphEL (for Graph, implemented as Edge List)
366 * Renamed some functions of BipartiteGraph:
367 add1() -> addNode1()
368 erase1() -> eraseNode1()
369 nr1() -> nrNodes1()
370 add2() -> addNode2()
371 erase2() -> eraseNode2()
372 nr2() -> nrNodes2()
373 * Renamed some functions in ClusterGraph:
374 ClusterGraph::eliminationCost() -> ::eliminationCost_MinFill()
375 ClusterGraph::VarElim() -> ClusterGraph::VarElim( sequentialVariableElimination( ElimSeq ) )
376 ClusterGraph::VarElim_MinFill() -> ClusterGraph::VarElim( greedyVariableElimination( eliminationCost_MinFill ) )
377 * Changed interface of one RegionGraph constructor
378 * Renamed "Clamped BP" into "Conditioned BP"
379
380 Bug fixes:
381 * Fixed regression in scripts/regenerate-properties (now all errors are
382 gathered before throwing the exception, as used to be the case)
383 * Fixed FTBFS errors on MACOSX (thanks to Sebastian Riedel for reporting this bug)
384 * [Alexander Schwing] Fixed error in BP that occured with damping
385 and using log-domain updates
386 * Fixed bug in HAK for trivial region graphs (with only one outer region
387 and no inner regions), reported by Alejandro Lage.
388 * Fixed long-standing bug in TreeEP (now, within-loop propagation optimization works)
389
390
391 libDAI-0.2.3 (2009-11-16)
392 -------------------------
393
394 New features:
395 * Complete doxygen documentation (although more detailed documentation still
396 has to be written)
397 * [Charles Vaske] Added parameter learning for conditional probabilities by
398 Expectation Maximization
399 * [Patrick Pletscher] Added SWIG wrapper code for experimental python and
400 octave interfaces
401 * Added Max-Product functionality to JTree
402 * [Frederik Eaton] Added Back-Belief-Propagation
403 * [Frederik Eaton] Added approximate inference method "Clamped Belief Propagation"
404 * [Frederik Eaton] Added approximate inference method "Gibbs sampling"
405
406 Code cleanup:
407 * Updated copyright headers
408 * Cleaned up error handling by introducing the DAI_THROWE macro
409 * Introduced DAI_DEBASSERT macro to abbreviate a common pattern
410 * Replaced the standard assert() macro by DAI_ASSERT, which throws a
411 dai::Exception and is even active if NDEBUG is defined
412 * Removed all the virtual default constructors *::create(), as they are not used
413 * [Frederik Eaton] Removed unnecessary copy constructors and assignment operators
414 * [Frederik Eaton] Change cout to cerr in warnings and error messages
415
416 Miscellaneous improvements:
417 * BipartiteGraph:
418 - Added eraseEdge( size_t n1, size_t n2 )
419 - [Frederik Eaton] Improved documentation of Neighbor
420 * TProb<T>:
421 - Added divided_by(const TProb<T>&) const
422 - Added constructor TProb<T>( const std::vector<S> &v )
423 - Added size_t draw(), which draws a random index
424 - [Frederik Eaton] Added setUniform()
425 - [Frederik Eaton] Added sumAbs()
426 - [Frederik Eaton] Added argmax()
427 - [Giuseppe Passino] Added begin(), end()
428 * TFactor<T>:
429 - [Giuseppe Passino] Added begin(), end()
430 - [Charles Vaske] Added TFactor( const std::vector<Var> &vars, const std::vector<T> &p ),
431 which reorders variables to canonical ordering before storing the table
432 - Added constructor TFactor<T>( const VarSet &vars, const std::vector<S> &v )
433 - Extended functionality of TFactor<T>::operators +,-,+=,-= to handle different VarSets
434 - Added TFactor<T>::maxMarginal (similar to marginal but with max instead of sum)
435 * State:
436 - [Giuseppe Passino] Added prefix ++ operator
437 * Permute:
438 - [Charles Vaske] Added constructor in Permute for canonical variable ordering
439 * FactorGraph:
440 - [Frederik Eaton] Added clampVar()
441 - [Frederik Eaton] Added clampFactor()
442 - [Giuseppe Passino] Added begin(), end()
443 * PropertySet:
444 - Added keys(), for getting all keys
445 - [Frederik Eaton] Added default constructor
446 - [Frederik Eaton] Added constructor from string
447 * InfAlg:
448 - Added setProperties(), getProperties() and printProperties()
449 - [Frederik Eaton] Added beliefV(), beliefF()
450 * ExactInf:
451 - Added calcMarginal(const VarSet &)
452 * HAK:
453 - Added "init" parameter to allow for random initialization
454 * BP:
455 - [Giuseppe Passino] Added findMaximum(), which can be used after running
456 max-product BP to construct a global state with maximum probability
457 * JTree:
458 - Added findMaximum(), which can be used after running
459 max-product JTree to construct a global state with maximum probability
460 * MatLab interface:
461 - MEX file dai now also returns variable and factor beliefs
462 - [Sebastian Nowozin] MEX file dai now also optionally returns the MAP state
463 (only for BP and JTree)
464 * README is now created automatically from doxygen documentation
465 * [Frederik Eaton] Added script for automatically generating properties code (used by CBP and BBP)
466 * [Frederik Eaton] Added newInfAlgFromString to alldai.h/cpp
467 * [Frederik Eaton] Added some utility macros (DAI_PV, DAI_DMSG, DAI_IFVERB)
468 and functions (concat(),rnd()) to util.h
469 * Changed output stream operator<< for Var and VarSet
470 * [Frederik Eaton] Improved parsing code in tests/testdai to allow recursive
471 alias substitutions
472 * [Frederik Eaton] Added useful aliases to aliases.conf
473 * [Giuseppe Passino] Optimised maximum-residual BP by using a reversed ordered
474 set instead of the linear search (which can yield enormous speedups - a
475 factor 500 has been measured on a binary Ising grid with 128x128 variables!)
476 * Added debug assertions to Var which check for inconsistent dimensions of
477 variables with the same labels
478 * toc() now returns POSIX system time with maximum accuracy of microseconds
479 * Exception objects now remember their error code
480 * Examples:
481 - Moved example.cpp to examples/
482 - Added examples/example_bipgraph.cpp
483 - Added examples/example_varset.cpp
484 - Added examples/example_sprinkler.cpp
485 - Added examples/example_permute.cpp
486 - Added python and octave ports for examples/example_sprinkler.cpp
487
488 Build system:
489 * Improved Makefile:
490 - Merged Makefile.win and Makefile.shared into Makefile
491 - Macros DAI_VERSION and DAI_DATE have been introduced,
492 in order to store this information in a central place
493 - Introduced CCNODEBUGFLAGS in Makefile
494 - Switched Makefile.win to GNU Make syntax
495 - [Frederik Eaton] Added TAGS, lib targets to Makefile
496 * Compatibility:
497 - [Peter Gober] libDAI can now be built on Cygwin
498 - [Dan Preston] libDAI can now be built on Mac OS X
499 - Changed regression test so that it also works under Windows
500
501 Interface changes (the old interface is marked obsolete and will be removed in the next release):
502 * Var:
503 - Variable labels are now nonnegative (of type size_t)
504 * VarSet:
505 - Replaced calcState() by non-member calcLinearState()
506 - Replaced calcStates() by non-member calcState()
507 * Permute:
508 - Renamed convert_linear_index into convertLinearIndex
509 * TProb<>:
510 - Replaced log0() by log(true)
511 - Replaced takeLog0() by takeLog(true)
512 - Removed hasNonPositives()
513 - Renamed minVal() to min()
514 - Renamed maxVal() to max()
515 - Renamed totalSum() to sum()
516 * TFactor<>:
517 - Replaced log0() by TFactor<T>::log(true)
518 - Removed divided_by, use operator/ instead
519 - Removed divide, use operator/= instead
520 - Removed partSum(const VarSet&), use marginal(const VarSet&,false) instead
521 - Renamed minVal() to min()
522 - Renamed maxVal() to max()
523 - Renamed totalSum() to sum()
524 * FactorGraph:
525 - Changed clamp and clamp interfaces (the variable to be
526 clamped is now indicated by its index, not as a Var)
527 * RegionGraph:
528 - Renamed Check_Counting_Numbers into checkCountingNumbers
529 - Renamed Calc_Counting_Numbers into calcCountingNumbers
530 * Miscellaneous:
531 - Renamed Treewidth(const FactorGraph &) into boundTreewidth(const FactorGraph &)
532 - Replaced UEdgeVec by Graph
533 - Replaced DEdgeVec by new RootedTree class
534 - Moved functionality of GrowRootedTree() into constructor of RootedTree
535 - Merged calcPairBeliefsNew() into calcPairBeliefs()
536 - Removed calcMarginal2ndO()
537 - Renamed smallSet<T> to SmallSet<T>
538 - Removed class Diffs
539 - [Frederik Eaton] Added backwards compatibility layer for edge interface to
540 BipartiteGraph and FactorGraph (which will be obsoleted soon)
541
542 Bug fixes:
543 * Fixed reversal of min and max in
544 TFactor<T> min( const TFactor<T> &, const TFactor<T> & )
545 TFactor<T> max( const TFactor<T> &, const TFactor<T> & )
546 * [Sebastian Nowozin] Fixed memory leak in MEX file dai
547 * [Frederik Eaton] In PropertySet::getStringAs(), check for typeid(ValueType)
548 before typeid(std::string) (this fixes a strange bug for empty string property)
549 * Added work-around for bug in Boost Graph Library
550 * Fixed bug in MaxSpanningTree (it wrongly assumed that the tree was not empty).
551 * Fixed bug in calcMarginal and calcPairBeliefs where states with zero probability
552 mass were clamped, leading to NaNs or assertion errors (thanks to Dan Preston
553 for reporting this)
554
555
556 libDAI-0.2.2 (2008-09-30)
557 -------------------------
558
559 New features:
560 * Approximate inference methods now report the number of iterations needed.
561 * Added damping to various algorithms to improve convergence properties.
562 * Added more features to utils/createfg for creating factor graphs.
563 * Added ExactInf class for brute force exact inference.
564 * [Giuseppe Pasino] Added "logdomain" property to BP, a boolean that controls
565 whether calculations are done in the log-domain or in the linear domain;
566 doing calculations in the log-domain may help if the numerical range
567 of a double is too small.
568 * [Claudio Lima] Added Max-Product functionality to BP.
569 * Improved documentation.
570
571 Improved architecture:
572 * Added Exceptions framework.
573 * Pervasive change of BipartiteGraph implementation (based on an idea by
574 Giuseppe Passino). BipartiteGraph no longer stores the node properties
575 (former _V1 and _V2), nor does it store a dense adjacency matrix anymore,
576 nor an edge list. Instead, it stores the graph structure as lists of
577 neighboring nodes. This yields a significant memory/speed improvement for
578 large factor graphs, and is more elegant as well. Iterating over neighbors is
579 made easy by using boost::foreach.
580 * Added conditional compilation of inference methods.
581 * VarSet is now implemented using a std::vector<Var> instead of a
582 std::set<Var>, which yields a significant speed improvement. Furthermore,
583 the implementation has been generalized, resulting in the small_set<T> class
584 which can be used to represent sets of small cardinality; VarSet is the
585 specialization with T = Var.
586 * Improved ClusterGraph implementation, yielding significant speedups
587 for the JunctionTree algorithm on large factorgraphs.
588
589 Code cleanup:
590 * Moved everything into namespace "dai".
591 * Renamed DEBUG to DAI_DEBUG to avoid conflicts.
592 * Replaced ENUM2,ENUM3,ENUM4,ENUM5,ENUM6 by single DAI_ENUM macro.
593 * Removed utils/remove_short_loops and matlab/remove_short_loops.
594 * Replaced sub_nb class in mr.h by boost::dynamic_bitset.
595 * Improved index.h:
596 - Renamed Index -> IndexFor
597 - Added some .reserve()'s to IndexFor methods which yields a
598 25% speedup of testregression
599 - Replaced multind by Permute
600 - Added MultiFor
601 - Added State
602 * New funcstionality of factor.h.
603 * Moved Properties and MaxDiff frameworks from InfAlg to each individual
604 inference algorithm, because the Properties framework was not as
605 convenient as I hoped, and not every inference algorithm needs a maxdiff
606 variable. Also, replaced some FactorGraph functionality in InfAlg by a
607 function that returns the FactorGraph. The result is cleaner (less
608 entangled) code.
609 * Removed x2x.
610 * Replaced Complex with real numbers (negative potentials are just too rare
611 to warrant the additional "complexity" :)).
612
613 Miscellaneous improvements:
614 * Now compiles also with MS Visual C++ (thanks to Jiuxiang Hu) and with
615 GCC under Cygwin.
616 * Contributions by Peter Gober:
617 - Renamed variable _N in mr.* for compatibility with g++ under Cygwin.
618 * Misc contributions by Giuseppe Passino:
619 - removed "using namespace std;" from header files - bad practice;
620 - moved header files in include/dai and sources in src;
621 - changed #ifndefs to GNU style;
622 - added extra warning checks (-W -Wextra) and fixed resulting warnings;
623 - dai::TProb:
624 o removed copy constructor and assignment operators (redundant);
625 o implementation of some methods via STL algorithms;
626 o added methods takeExp, takeLog, takeLog0 for transformation in-place;
627 o explicit constructor (prevents implicit conversion from size_t to TProb);
628 o added operator+,+=,-,-=, with argument T (for calculations in log-scale);
629 * Misc contributions by Christian Wojek:
630 - New FactorGraph constructor that constructs from given ranges of factors
631 and variables;
632 - Optimization of FactorGraph constructors using tr1::unordered_map.
633 * FactorGraph constructors no longer check for short loops (huge speed
634 increase for large factor graphs), nor for negative entries. Also, the
635 normtype is now Prob::NORMPROB by default.
636 * Improved MaxSpanningTreePrims algorithm (uses boost::graph).
637
638 Interface changes:
639 * VarSet::
640 - VarSet::stateSpace() -> nrStates(const VarSet &)
641 - VarSet( const std::set<Var> ) -> VarSet( begin, end, sizeHint=0 )
642 - VarSet( const std::vector<Var> ) -> VarSet( begin, end, sizeHint=0 )
643 - removed bool operator||
644 - operator&&(const VarSet&) -> intersects(const VarSet&)
645 - operator&&(const Var&) -> contains(const Var&)
646 * FactorGraph::
647 - delta(const Var &) -> delta(size_t)
648 - Delta(const Var &) -> Delta(size_t)
649 - makeCavity(const Var &) -> makeCavity(size_t)
650 - vars() -> vars
651 - factors() -> factors
652 - removed MakeFactorCavity(size_t)
653 - removed ExactMarginal(const VarSet &)
654 - removed ExactlogZ()
655 - removed updatedFactor(size_t)
656 - removed _normtype and NormType()
657 - removed hasShortLoops(...) and removeShortLoops(...)
658 - WriteToDotFile(const char *filename) -> printDot( std::ostream& os )
659 - undoProb(size_t) -> restoreFactor(size_t)
660 - saveProb(size_t) -> backupFactor(size_t)
661 - undoProbs(const VarSet &) -> restoreFactors(const VarSet &)
662 - saveProbs(const VarSet &) -> backupFactors(const VarSet &)
663 - ReadFromFile(const char*) returns void (throws on error)
664 - WriteToFile(const char*) returns void (throws on error)
665 - removed hasNegatives()
666 * RegionGraph::
667 - nr_ORs() -> nrORs()
668 - nr_IRs() -> nrIRs()
669 - ORs() -> ORs
670 - IRs() -> IRs
671 * *::Regenerate() -> *::construct()
672 * Renamed Index -> IndexFor
673 * Diffs:
674 - max() -> maxDiff()
675 - max_size() -> maxSize()
676 * Prob::max() -> Prob::maxVal()
677 * Factor::
678 - max() -> maxVal()
679 - part_sum() -> partSum()
680 * toc() in util.h now returns seconds as a double
681 * VarSet::operator&&
682 * Properties -> PropertySet
683
684
685 libDAI-0.2.1 (2008-05-26)
686 -------------------------
687
688 Bugfix release.
689 * added missing cstdio header in util.h
690 * fixed Properties in MR_CLAMPING_* and MR_EXACT_*
691 * added description of the factor graph fileformat
692 * improved Makefile
693
694
695 libDAI-0.2.0 (2006-11-30)
696 -------------------------
697
698 First public release.
699
700
701 0.1.5 (2006-11-30)
702 ------------------
703
704 Regressions
705
706 - tests/testlcbp and tests/testlcbp are broken.
707 - EXACT method does not work anymore.
708 - The Properties framework gives a speed penalty because of the lookup
709 costs involved; inner loops should be optimized.
710
711 General framework
712
713 - DAIAlg is now a template class; typedefs for DAIAlg<FactorGraph> and for
714 DAIAlg<RegionGraph> are provided. In this way, we do not have to write "wrapper"
715 functions to forward functionality from either FactorGraph or RegionGraph
716 to DAIAlg. Functionality like clamping can be implemented in FactorGraph
717 and in RegionGraph and no explicit interface is needed in descendants.
718 - New abstract base class InfAlg added, representing an inference algorithm,
719 from which DAIAlg<T> inherits. This solves the incompatibility problems of
720 DAIAlg<T> for different T (e.g. DAIAlg<FactorGraph> was incompatible with
721 DAIAlg<RegionGraph>). More work is required to reduce code duplication
722 (make FactorGraph part of InfAlg).
723 - Added generic interface (nrVars(), Vars(), nrFactors(), factor(size_t),
724 beliefs(), belief(VarSet &), ...) to InfAlg and descendants.
725 - Added a saveProbs/undoProbs interface to InfAlg and descendants that enables
726 one to save a few factors, modify them (e.g. clamp them), and then restore them
727 to their old values. Undo should also init the corresponding messages / beliefs.
728 This can be used if a given factor graph repeatedly needs to be clamped in
729 different ways and an approximation method is run for each clamping; using the
730 saveProbs/undoProbs can give a significant speed increase.
731 - Switched to a general Properties framework that handles the parameters of
732 all inference methods in a uniform manner. The Properties class is a map of
733 several properties in boost::any objects, indexed by their names (strings).
734 It can read from a stream and write to a stream. It is recursive, in the sense
735 that a Properties object can hold a variable of type Properties as well.
736 - Added a generic way of constructing inference algorithms from a factor graph,
737 name and properties object. Added the newInfAlg function which constructs
738 the requested object. This is used by LCBP, the Matlab interface and the
739 command line (test) interface.
740 - Added a generic enum framework for enum parameters. Although implemented as a
741 hack, it is quite useful in that it drastically simplifies and reduces the
742 amount of code for handling enum parameters.
743 - Provided generic functions for calculating marginals in different ways that
744 work for all approximate inference methods.
745
746 Bugfixes
747
748 - Fixed GBP free energy.
749 - Fixed bug in junctiontree (it didn't init the _vars variable).
750 - Corrected two bugs in operator&& and operator|| in VarSet (they returned
751 the logical NOT of what they should return).
752 - Fixed bug in RegionGraph::RecomputeOR(s).
753 - Fixed bug in utils/create_dreg_fg:
754 graph structure was not random for given parameters (forgot to call srand()).
755 - TreeEP bug workaround: use the complete junction tree instead of a subtree.
756 - Fixed bug in JTree::HUGIN() and JTree:ShaferShenoy() in case of junction tree
757 that consists of one outer region only.
758 - Fixed INIT bug in LCBP2::UpdatePancake().
759 - Fixed MaxDiffs flow (except for MR).
760
761 New functionality
762
763 - HAK supports several default cluster choices:
764 minimal (only factors)
765 delta (Markov blankets)
766 loop (all loops consisting of loops consisting of <loopdepth> or less variables)
767 Only the maximal clusters are used as outer clusters.
768 - Implemented TreeEP. It generalizes the heuristic method described in the
769 Minka & Qi paper for obtaining a tree with the most relevant interactions to
770 higher order interactions. Almost all optimizations described in the Minka & Qi
771 paper are used, except that evidence is passed over the whole tree instead of
772 relevant subsets (the latter is almost implemented but buggy). Also added
773 alternative (worst-case) algorithm that uses a maximum spanning tree on the
774 weighted graph where the weight between neighbours i and j is given by
775 N(psi,i,j), where psi is the product of all the factors involving both i and j
776 (which is an upper bound on the effective interaction between i and j).
777 - Implemented MR (MontanariRizzo) based on Bastian's code, but extended it
778 to be able to handle connectivities larger than 3 (in principle, up to 32).
779 It supports different initialization methods (the original RESPPROP,
780 the CLAMPING method and EXACT which uses JTree) and different update methods
781 (FULL and LINEAR).
782 - Implemented LCBP2, an analogon of LCBP which represents pancakes as little
783 networks and uses some approximate inference method on them for calculating
784 marginals.
785 - Now there are several LCBP variants (LCBP, LCBPI, LCBPJ, LCBPK, LCBPL);
786 LCBPJ works only for pairwise, LCBPK is LCBP improved for higher order
787 interactions and LCBPL is LCBPI improved for higher-order interactions.
788 - Wrote one single program utils/createfg for creating various types of
789 random factor graphs.
790 - Wrote utility to visualize factor graphs using graphviz.
791 (it uses the BOOST Program Options library)
792 - Added fginfo utility that displays some info about a .fg file.
793 - Implemented Factor::strength function that calculates the potential strength
794 N(psi,i,j) between variables i and j as described in cs.IT:0504030
795 - Wrote a general MatLab interface matlab/dai (similar to tests/test);
796 this unified the matlab functions dai, dai_bp, dai_mf, dai_jt, dai_tep, dai_cvm.
797 - Added MATLAB routine that returns contraction matrix A for BP convergence analysis.
798 - Implemented a MATLAB interface ai_potstrength for Factor::strength
799 - Added Martijn's x2x
800
801 Improvements of existing code
802
803 - Reimplemented RegionGraph and descendants: a RegionGraph ISA FactorGraph
804 and also a BipartiteGraph<FRegion,Region>. It now also keeps a map that
805 associates outer region indices to factor indices (no powers yet, this
806 is deemed superfluous) and provides functions to recompute (some of) the
807 outer regions from the factors.
808 - InfAlg descendants run() methods now stop immediately and return NAN in case
809 they detect NANs. Only BP does not do NAN checking for performance reasons.
810 - LCBP now works with factors containing zeroes (by defining x/0 = 0).
811 - HAK, GBP and DoubleLoop now conform to the standards for verbose reporting,
812 timing and convergence criteria.
813 - Implemented logZ() for JTree. It does the calculation during message-passing.
814 - Marginal2ndO now optionally divides by the single node beliefs (to the power n-2);
815 hopefully this will give more accurate approximations.
816 - Marginal and Marginal2ndO (optionally) use the new saveProbs/undoProbs functionality
817 for a faster way of calculating marginals, which does not require a call to init()
818 nor cloning the whole object for each clamping. This leads to a significant speedup.
819 - LCBP (and LCBP2) now have complete flexibility in the specification of the
820 inner method, i.e. the method used to generate the initial cavity approximations.
821 One can pass two strings, a name and a properties string, and LCBP simply invokes
822 newInfAlg to construct the corresponding inference algorithm and uses the generic
823 marginal functions to approximate cavity marginals.
824 - Replaced the global "method" variable by local properties and removed ai.h
825 - Added some methods to Factor (operators *, *=, /, /= with doubles as
826 second argument, operators -, +=, -= with other Factors as second
827 arguments, randomize(), RemoveFirstOrderInteractions) and similar
828 operations to Prob
829 - Moving towards boost::program_options for handling command line arguments
830 (tests/test is done).
831 - Renamed some FactorGraph methods:
832 nr_vars -> nrVars
833 nr_factors -> nrFactors
834 varind -> findVar
835 factorind -> findFactor
836 makeFacCavity -> makeFactorCavity
837 - LCBP_SEQMAXRES has been removed because it did strange things.
838 - Implemented RandomDRegularGraph
839 - Implemented JTree::calcMarginal for marginals that are not confined
840 within one cluster (using cut-set conditioning).
841 - Added isConnected() method to FactorGraph (some methods do not work with
842 disconnected factor graphs).
843 - Pair beliefs are now calculated in a symmetrical way by calcPairBeliefs
844 - Removed single node interaction "correction" code from clamping methods
845 - Removed calcCavityDist and calcCavityDist2ndO
846 - No longer depends on GSL.
847 - Increased portability by combining platform dependant utility functions
848 in util.{h,cpp}.
849 - Wrote *.m files providing help
850
851 Testing framework
852
853 - Made a new and significantly improved testing framework that provides most
854 functionality from the command line.
855 - The basis is provided by tests/test, which uses the newInfAlg functionality
856 and enables the user to easily compare from the command line different
857 inference methods on a given factorgraph. All parameters can be specified.
858 Output consists of CPU time, average and maximum single variable marginal
859 errors, relative logZ error and MaxDiff().
860 - tests/aliases.conf contains aliases for standard combinations of methods
861 and their options (which can be used in tests/test).
862 - tests/large contains several bash/python scripts that create random factor
863 graphs, compare several approximate inference algorithms (using tests/test) and
864 allow for easy visualization of the results using PyX.
865 - Added several .fg files for test purposes to /tests (e.g. two ALARM versions
866 alarm.fg and alarm_bnt.fg; testfast.fg, a 4x4 periodic Ising grid for
867 regression testing).
868 - Added a regression test to the Makefile which is included in the standard
869 target. It compares all inference methods on tests/testfast.fg with the
870 results stored in tests/testfast.out
871
872 Miscellaneous
873
874 - Expanded all tabs to spaces (":set tabstop 4\n:set expandtab\n:retab" in vim)
875 - Experimental MATLAB code added for StarEP approximation on cavity
876 - Renamed project to libDAI and changed directory name accordingly.
877 - Renamed JunctionTree to JTree.
878 - Fixed licensing (now it's officially GPL).
879 - Improved README
880
881
882 revision 252
883 ------------
884
885 Functionality
886 - Added RegionGraph, GBP, CVM and HAK (double-loop).
887 - Added JunctionTree (with two update algorithms, HUGIN and Shafer-Shenoy), which is a
888 RegionGraph.
889 - NormType is now chosen automatically (in case of negative factors, Prob::NORMLINF is used,
890 otherwise the default Prob::NORMPROB is used). Also, in case of negative factors, the
891 RegionGraph constructors assign each Factor to a unique outer region instead of dividing
892 it over all subsuming outer regions. See README for when negative factors are known to work
893 and when not.
894 - FactorGraph::FactorGraph(const vector<Factor>) only gives a warning in case of short loops,
895 it does not automatically merge factors anymore.
896 - Removed BP_SEQMAXRESNOCLEAR (all cavity initialization methods now are implicitly NOCLEAR)
897 - Added MATLAB interface functions ai_readfg, ai_removeshortloops and ai_bp
898 - Added LCBP-III type that should be equivalent to LCBP-II, but can handle zeroes
899 in potentials. Note that it is significantly slower than LCBP-II (and has to be reimplemented
900 such that it does not store the complete pancakes, but represents them as little factor graphs).
901
902 Implementation / code
903 - Made a seperate type WeightedGraph, which until now only implements Prim's
904 maximal spanning tree algorithm and is only used by the junction tree code. It might
905 be good to make it a class somewhere in the future and extend it's interface.
906 - Made a seperate class ClusterGraph, which is only used by the junction tree
907 code. It's main purpose is a graph-theoretical variable elimination algorithm.
908 - Implemented the heuristic "minimum-new-edges-in-clique-graph" for variable elimination.
909 - Massive code cleanup, moving towards "generic" programming style, using
910 multiple inheritance and polymorphism.
911 o BP, LCBP, MF, HAK and JunctionTree now inherit from a common DAIAlg class
912 o Made generic functions Marginal, Marginal2ndO, calcCavityDist, calcCavityDist2ndO, clamp
913 that can be used by FactorGraph-based DAIAlgs.
914 o Created TProb<T> class, which stores a probability vector (without the accompanying indexing
915 and VarSet) and provides functionality for it (which is used by TFactor<T>).
916 o Rewrote the VarSet class. It now caches its statespace(). It now privately inherits from set<Var>.
917 I had to overload the insert methods of set<Var> so that they calculate the new statespace.
918 o Rewrote the TFactor class. The TFactor class now HAS a TProb and HAS a VarSet.
919 - Rewrote BP to use the new TProb<T> interface. Performance of BP improved up to a factor 6 by:
920 o using Prob's instead of Factor's;
921 o splitting the multiplication of the messages into two parts (thanks to Vicenc!);
922 o optimizing the calculation of the beliefs (only the message calculations were optimized till now).
923 o replacing FactorGraph::_nb1 and _nb2 (which were set<size_t>) by vector<size_t>
924 - LCBP now seperately stores cavitydists and pancakes. Added InitPancakes() method
925 that takes the cavitydists and multiplies them with the relevant factors. This
926 resulted in an API change in AI which now accepts and returns initial cavitydists
927 instead of initial pancakes.
928
929 Minor changes
930 - Started writing DoxyGen documentation
931 - Renamed lcptab2fg.m matlab/ai_writefg.m
932 - Moved all matlab stuff to matlab/
933 - More detailed reporting (also reports clocks used).
934 - Marginal and Marginal2ndO now use *differences* in logZ to avoid NaNs.
935 - Improved testing suite.
936 - Removed logreal support.
937 - FactorGraph now also supports input streams and ignores comment lines in .fg files.
938 - Added tests/create_full_fg.cpp and tests/create_ising_fg.cpp which create
939 full and periodic 2D Ising networks according to some command line parameters.
940 - Now logZ really returns logZ instead of -logZ.
941 - Added FactorGraph::WriteToDotFile
942
943
944 0.1.4 (2006-04-13)
945 ------------------
946 - Added file IO routines to read and write factorgraphs.
947 - Added L-infinity normalization for use with (partially) negative factors.
948 - Renamed BetheF, MFF to logZ, which now use complex numbers to be able to
949 handle (partially) negative factors.
950 - Added test suite.
951 - All probabilities are now represented using double instead of LogReal<double>.
952 - Combined Alg and Alg3 into LCBP. Several update schemes possible.
953 - Combined several variants of BP into doBP. Several update schemes possible.
954 Now uses precalculated indices for optimization.
955 - Renamed Node -> Var and Potential -> Factor.
956 - Extensive code cleanup. More use of OO techniques. Changed API.
957 - MaxIter now means maximum number of passes (corresponding to number of
958 _parallel_ updates).
959 - MaxDiff now means the maximum L-infinity distance between the updated and
960 original single variable beliefs, for all AI methods.
961 - Implemented RBP which converges faster than BP for difficult problems.
962 - Now uses method parameter which is a bitmask combining outmethod and inmethod
963 (see ai.h).
964
965
966 0.1.3 (2006-03-22)
967 --------------------
968 - All AI methods now return maxdiff
969 - ai.cpp:
970 o Now returns maxdiffinner and maxdiffouter
971 o New BP2ndO innermethod (estimate only 2nd order cavity interactions)
972 o New InitCav outermethod (only create initial cavity distributions)
973 - bp.cpp:
974 o New CavityDist2ndO which estimates 2nd order cavity interactions
975 - Makefile:
976 o Bugfix: removed dependencies on algwim.*
977
978
979 0.1.2 (2006-02-28)
980 --------------------
981 - Cleaned up alg.cpp (removed Alg2 and its corresponding data structures).
982 - Added the possibility to provide initial cavity distributions as an input
983 argument to ai (not much error checking is done, so be careful).
984 - Potentials2mx now correctly sets the dimensions of the P field (i.e. for
985 the output arguments Q, Q0 of ai).
986 - Removed algwim.* since it does not work.
987
988
989 0.1.1 (2006-02-28)
990 --------------------
991 - The constructors of (Log)FactorGraph and LogFactorGraph from a
992 vector<(Log)Potential> now merge potentials to prevent short loops (of length
993 4) in the factor graph. These are used in ai to construct the factor graphs
994 from the psi argument. If compiled with DEBUG defined, the method calc_nb()
995 of BipGraph checks for the existence of short loops.
996 - Changed calling syntax of ai (now the actual syntax *does* correspond to its
997 description in the help).
998 - ai does not hook cout anymore (which caused weird segfaults).
999 - Fixed a bug in an assert statement in the matlab interface code in ai.cpp.
1000 - Removed network.* since it is not useful.
1001
1002
1003 0.1.0 (2006-02-28)
1004 --------------------
1005 First version worthy of a version number.