Alpar Juttner <alpar@cs.elte.hu> [Thu, 27 Nov 2008 22:05:35 +0000] rev 386
Give different names to the different DIMACS readers
Alpar Juttner <alpar@cs.elte.hu> [Thu, 27 Nov 2008 22:04:46 +0000] rev 385
Port DIMACS tools from svn -r3516
Namely,
- apply migrate script
- apply unify sources
- break long lines
- Fixes the compilation
- dim_to_lgf -> dimacs-to-lgf
- better .hgignore
- shorten the doc of dimacs-to-lgf
Alpar Juttner <alpar@cs.elte.hu> [Fri, 21 Nov 2008 10:49:39 +0000] rev 384
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 21 Nov 2008 11:10:25 +0100] rev 383
Doc improvements for elevator classes (#174)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 21 Nov 2008 10:41:36 +0000] rev 382
Don't assume that the default maps are reference maps (in Elevator)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 17 Nov 2008 15:41:15 +0000] rev 381
Avoid STL panic at Elevator when compiled with -D_GLIBCXX_DEBUG
Alpar Juttner <alpar@cs.elte.hu> [Mon, 17 Nov 2008 15:41:15 +0000] rev 380
Rename markToBottom() to dirtyTopButOne() + better doc (#174)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 17 Nov 2008 15:41:15 +0000] rev 379
Port Elevator from svn -r3516 (#174)
- the unify script hes also been applied
Alpar Juttner <alpar@cs.elte.hu> [Tue, 11 Nov 2008 10:25:57 +0000] rev 378
Merge
Alpar Juttner <alpar@cs.elte.hu> [Tue, 11 Nov 2008 10:12:37 +0000] rev 377
Bugfix in Random (#173)
- operator()s always return a double now
- the faulty real<Num>(Num) and real<Num>(Num,Num) have been removed
Alpar Juttner <alpar@cs.elte.hu> [Mon, 10 Nov 2008 11:14:56 +0000] rev 376
chg-len.py uses the Mercurial API directly
This makes chg-len.py much faster.
Alpar Juttner <alpar@cs.elte.hu> [Fri, 07 Nov 2008 13:14:22 +0000] rev 375
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 07 Nov 2008 12:15:16 +0100] rev 374
Extend test cases for graphs and digraphs (#172)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 07 Nov 2008 12:00:53 +0100] rev 373
Bug fix in SmartGraph::restoreSnapshot() (#171)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 07 Nov 2008 13:04:54 +0000] rev 372
Avoid bit operator precedence warning with gcc-4.3
Some of these warnings are actually revealed real bugs
Alpar Juttner <alpar@cs.elte.hu> [Fri, 07 Nov 2008 07:18:37 +0000] rev 371
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 06 Nov 2008 23:12:57 +0100] rev 370
Critical bug fix in SmartDigraph::split() #170
Alpar Juttner <alpar@cs.elte.hu> [Fri, 07 Nov 2008 06:36:12 +0000] rev 369
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 06 Nov 2008 18:35:38 +0100] rev 368
Add missing tags and functions for item counting in SmartGraph (#3)
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 06 Nov 2008 18:23:52 +0100] rev 367
Hide "used files" on the doc pages
Alpar Juttner <alpar@cs.elte.hu> [Thu, 06 Nov 2008 14:40:32 +0000] rev 366
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Thu, 06 Nov 2008 15:16:37 +0100] rev 365
Rework hypercube graph implementation to be undirected (#57)
Peter Kovacs <kpeter@inf.elte.hu> [Wed, 05 Nov 2008 21:36:28 +0100] rev 364
Port hypercube digraph structure from SVN 3503 (#57)
Akos Ladanyi <ladanyi@tmit.bme.hu> [Wed, 05 Nov 2008 14:44:37 +0000] rev 363
Revert to the canonical way of customizing CXXFLAGS
A default list of compiler flags is set via AM_CXXFLAGS Automake variable.
However this gets overridden by per-target CXXFLAGS variables (e.g.
foo_CXXFLAGS in case the foo target). Because of this you should append
$(AM_CXXFLAGS) to the end of the per-target CXXFLAGS variables (e.g.
foo_CXXFLAGS = ... $(AM_CXXFLAGS)).
After this default list of flags the contents of the CXXFLAGS user variable is
passed to the compiler. This variable has a default value determined by
configure (in case of g++ it is '-g -O2'). You can override this by specifying
CXXFLAGS when invoking make (e.g. make CXXFLAGS='-O3').
Alpar Juttner <alpar@cs.elte.hu> [Wed, 05 Nov 2008 08:11:44 +0000] rev 362
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 04 Nov 2008 21:37:59 +0100] rev 361
Doc improvements for the graph related tools in lemon/bits
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 04 Nov 2008 21:36:46 +0100] rev 360
Add missing tags and indicators
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 04 Nov 2008 21:25:15 +0100] rev 359
Rename readNauty() to readNautyGraph() (#55)
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 04 Nov 2008 21:14:57 +0100] rev 358
Redo erroneous modification of [7c5d8de2eac7] (#55)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 04 Nov 2008 10:25:47 +0000] rev 357
Merge
Alpar Juttner <alpar@cs.elte.hu> [Tue, 04 Nov 2008 10:21:22 +0000] rev 356
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 03 Nov 2008 22:30:21 +0100] rev 355
Bug fix in FullDigraphBase::findArc()
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 01 Nov 2008 19:22:18 +0100] rev 354
Improvements related to full graphs (#57)
Balazs Dezso <deba@inf.elte.hu> [Thu, 14 Aug 2008 21:49:39 +0200] rev 353
Porting full graphs from svn 3498
- the FullGraph is redesigned in implementation
- some improvemnts in documentation
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 03 Nov 2008 17:03:13 +0100] rev 352
Small improvements for the nauty reader (#55)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 03 Nov 2008 16:59:14 +0100] rev 351
Move the doc of the nauty group to groups.dox (#55)
Balazs Dezso <deba@inf.elte.hu> [Wed, 29 Oct 2008 15:29:34 +0100] rev 350
Swap parameters in readNauty()
Alpar Juttner <alpar@cs.elte.hu> [Wed, 29 Oct 2008 14:06:08 +0000] rev 349
Merge
Balazs Dezso <deba@inf.elte.hu> [Sat, 18 Oct 2008 00:05:22 +0200] rev 348
Porting nauty reader function from SVN #3509
Alpar Juttner <alpar@cs.elte.hu> [Wed, 29 Oct 2008 06:22:21 +0000] rev 347
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 28 Oct 2008 23:10:27 +0100] rev 346
Minor doc improvements related to Suurballe (#47)
Alpar Juttner <alpar@cs.elte.hu> [Tue, 28 Oct 2008 18:39:53 +0000] rev 345
Port Suurballe algorithm from svn -r3512
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 28 Oct 2008 21:35:06 +0100] rev 344
More improvement in the migration script
- Rename (U)GRAPH_TYPEDEFS.
- Rename "directed graph" to "digraph".
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 28 Oct 2008 18:33:51 +0100] rev 343
Improve the migration script and guide (#166)
- Safer replacement of 'graph' and 'edge'.
- Fix the erroneous renaming of [Gg]raphToEps.
- Fixes and improvements in the migration guide.
Alpar Juttner <alpar@cs.elte.hu> [Tue, 28 Oct 2008 14:49:18 +0000] rev 342
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 28 Oct 2008 15:37:46 +0100] rev 341
Use standard error/warning message format in the unifier script
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 28 Oct 2008 14:47:57 +0100] rev 340
Minor doc improvements
Alpar Juttner <alpar@cs.elte.hu> [Thu, 19 Jun 2008 17:33:06 +0100] rev 339
Lognormal distribution added (#102)
Balazs Dezso <deba@inf.elte.hu> [Thu, 23 Oct 2008 12:39:39 +0200] rev 338
Fix latex image generation
Alpar Juttner <alpar@cs.elte.hu> [Wed, 22 Oct 2008 22:14:00 +0100] rev 337
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Sat, 18 Oct 2008 13:15:00 +0200] rev 336
Fixes and improvements related to GridGraph
Balazs Dezso <deba@inf.elte.hu> [Mon, 20 Oct 2008 12:36:02 +0200] rev 335
Improvement on grid graphs
- The indexing of matrix is changed according to integer points of the plane.
- The graph type does not depend on the UndirGraphExtender.
- Improving documentation.
- Improved image generation.
Peter Kovacs <kpeter@inf.elte.hu> [Tue, 02 Sep 2008 22:32:04 +0200] rev 334
Port grid graph structure from SVN 3503 (ticket #57)
Alpar Juttner <alpar@cs.elte.hu> [Wed, 22 Oct 2008 14:41:18 +0100] rev 333
Merge
Alpar Juttner <alpar@cs.elte.hu> [Wed, 22 Oct 2008 14:39:04 +0100] rev 332
Merge
Alpar Juttner <alpar@cs.elte.hu> [Wed, 22 Oct 2008 14:37:43 +0100] rev 331
Merge
Alpar Juttner <alpar@cs.elte.hu> [Wed, 22 Oct 2008 13:53:34 +0100] rev 330
Doc improvements in lemon/max_matching.h
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 20 Oct 2008 12:46:39 +0200] rev 329
Print the failed line numbers in the unifier script (ticket #138)
Peter Kovacs <kpeter@inf.elte.hu> [Mon, 20 Oct 2008 12:17:24 +0200] rev 328
Small improvements in the unifier script
Balazs Dezso <deba@inf.elte.hu> [Mon, 13 Oct 2008 14:00:11 +0200] rev 327
Several improvements in maximum matching algorithms
- The interface of MaxMatching is changed to be similar to the
weighted algorithms
- The internal data structure (the queue implementation and the
matching map) is changed in the MaxMatching algorithm, which
provides better runtime properties
- The Blossom iterators are changed slightly in the weighted matching
algorithms
- Several documentation improvments
- The test files are merged