Peter Kovacs <kpeter@inf.elte.hu> [Fri, 09 Jan 2009 12:43:52 +0100] rev 473
Add creator functions for Residual and Residual::ResidualCapacity (#67)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 12 Dec 2008 22:59:17 +0100] rev 472
Various bug fixes and code improvements in adaptors.h (#67)
- Fix UndirectorBase::nodeNum().
- Fix UndirectorBase::findEdge().
- Fix OrienterBase::addArc().
- Fix OrienterBase::findArc().
- Improve SplitNodesBase::findArc().
- Add missing notifier() function in UndirectorBase.
- Add missing typedefs for maps (conform to the ReferenceMap concept).
- Add some useful typedefs for graph adaptors.
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 12 Dec 2008 22:18:41 +0100] rev 471
Add missing const keywords (+ remove misleading ones) (#67)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 12 Dec 2008 22:09:29 +0100] rev 470
Avoid warning in adaptors.h (#67)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 12 Dec 2008 22:00:03 +0100] rev 469
Fix the usage of tags in adaptors.h (#67)
There are separate tags for arcs and edges now.
Alpar Juttner <alpar@cs.elte.hu> [Thu, 08 Jan 2009 17:19:26 +0000] rev 468
Merge
Alpar Juttner <alpar@cs.elte.hu> [Thu, 08 Jan 2009 17:10:42 +0000] rev 467
Update to 2009 plus whitespace unification
Balazs Dezso <deba@inf.elte.hu> [Tue, 02 Dec 2008 23:15:43 +0100] rev 466
Rename counterSort to stableRadixSort
Alpar Juttner <alpar@cs.elte.hu> [Tue, 02 Dec 2008 10:17:30 +0000] rev 465
Doc improvements and source unification in radix_sort (#72)
Balazs Dezso <deba@inf.elte.hu> [Fri, 17 Oct 2008 23:55:18 +0200] rev 464
Porting radix sorts from SVN #3509
Alpar Juttner <alpar@cs.elte.hu> [Thu, 01 Jan 2009 00:00:00 +0100] rev 463
Happy New Year again
- update the copyright headers + run the source unifier
Balazs Dezso <deba@inf.elte.hu> [Sun, 21 Dec 2008 20:46:35 +0100] rev 462
Merge bugfix #197
Balazs Dezso <deba@inf.elte.hu> [Sun, 21 Dec 2008 20:47:15 +0100] rev 461
Merge bugfix #197
Balazs Dezso <deba@inf.elte.hu> [Sun, 21 Dec 2008 20:45:25 +0100] rev 460
Bug fix in heap unionfind (ticket #197)
The previous bugfix set the minimum value in internal nodes
wrongly. It corrects the problem.
Balazs Dezso <deba@inf.elte.hu> [Sun, 21 Dec 2008 00:16:46 +0100] rev 459
Merge bugfix #197
Balazs Dezso <deba@inf.elte.hu> [Sun, 21 Dec 2008 00:15:08 +0100] rev 458
Merge bugix #197
Balazs Dezso <deba@inf.elte.hu> [Sun, 21 Dec 2008 00:13:02 +0100] rev 457
Bug fix in heap unionfind (ticket #197)
The minimum item in the unionfind tree might become inconsistent when
the split operation merges two subtrees which have equal keys. The
current changeset fix the problem. It also fix a wrong index.
Alpar Juttner <alpar@cs.elte.hu> [Fri, 12 Dec 2008 22:16:17 +0000] rev 456
Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 12 Dec 2008 22:14:29 +0000] rev 455
Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 12 Dec 2008 21:58:45 +0000] rev 454
Merge
Alpar Juttner <alpar@cs.elte.hu> [Fri, 12 Dec 2008 21:41:05 +0000] rev 453
Merge
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 12 Dec 2008 21:46:08 +0100] rev 452
Hide all docs in variant.h (#196)
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 12 Dec 2008 21:44:37 +0100] rev 451
Bug fix in variant.h (#196)
Alpar Juttner <alpar@cs.elte.hu> [Fri, 12 Dec 2008 21:52:53 +0000] rev 450
Merge bugfix #195
Peter Kovacs <kpeter@inf.elte.hu> [Fri, 12 Dec 2008 21:37:22 +0100] rev 449
Bug fix in ConEdgeIt (#195)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 08 Dec 2008 21:50:34 +0000] rev 448
Merge
Alpar Juttner <alpar@cs.elte.hu> [Mon, 08 Dec 2008 21:47:15 +0000] rev 447
Merge bugfix #193
Balazs Dezso <deba@inf.elte.hu> [Mon, 08 Dec 2008 20:23:33 +0100] rev 446
Fix skipSection() function (ticket #193)
Alpar Juttner <alpar@cs.elte.hu> [Mon, 08 Dec 2008 15:47:20 +0000] rev 445
Merge
Balazs Dezso <deba@inf.elte.hu> [Mon, 08 Dec 2008 11:06:39 +0100] rev 444
Fix typos (ticket #192)