Age | Commit message (Collapse) | Author | Files | Lines | |
---|---|---|---|---|---|
2004-11-02 | Update to 1.2.0: | wiz | 1 | -76/+18 | |
# 1.2.0 * New algorithm added: Bidirectional Dijkstra's shortest path * A lot of bugfixes * Revised documentation # 1.1.0 * Returned to the libtool versioning style * New algorithms added o Dijkstra's shortest path o Bellman Ford shortest path o New variant of Maximal Flow * graph::load now creates nodes in the same order as they are in the gml file * graph::load now with parameter 'preserve_ids' to use the same ids as in the gml file * A lot of bugfixes * Documentation adapted to doxygen # 1.0.0 * First stable release * quick fix of bug in graph::del_node (thanks to David Auber) * bug fix in graph::hide_node (thanks to David Auber) * optimization of reallocation procedure in node_ and edge_maps (again, thanks to David) | |||||
2004-09-22 | Mechanical changes to package PLISTs to make use of LIBTOOLIZE_PLIST. | jlam | 1 | -5/+1 | |
All library names listed by *.la files no longer need to be listed in the PLIST, e.g., instead of: lib/libfoo.a lib/libfoo.la lib/libfoo.so lib/libfoo.so.0 lib/libfoo.so.0.1 one simply needs: lib/libfoo.la and bsd.pkg.mk will automatically ensure that the additional library names are listed in the installed package +CONTENTS file. Also make LIBTOOLIZE_PLIST default to "yes". | |||||
2001-11-01 | Move pkg/ files into package's toplevel directory | zuntum | 1 | -0/+111 | |