kpeter [Mon, 25 Feb 2008 12:35:06 +0000] rev 2579
Bug fixes in min cost flow files.
Use enum type instead of static constants in NetworkSimplex to avoid
linker errors.
ladanyi [Thu, 21 Feb 2008 13:06:33 +0000] rev 2578
Put the definitions of global functions into a .cc file.
kpeter [Mon, 18 Feb 2008 03:34:16 +0000] rev 2577
Add a cost scaling min cost flow algorithm.
Add a cost scaling algorithm, which is performing generalized
push-relabel operations. It is almost as efficient as the capacity
scaling algorithm, but slower than network simplex.
kpeter [Mon, 18 Feb 2008 03:32:56 +0000] rev 2576
Improvements in MinCostFlow and MinCostMaxFlow.
Main changes:
- MinCostMaxFlow also provides dual solution.
- Change the name of private members to start with "_".
- Change the name of function parameters not to start with "_".
- Remove unnecessary documentation for private members.
- Doc improvements.
kpeter [Mon, 18 Feb 2008 03:32:06 +0000] rev 2575
Major improvements in NetworkSimplex.
Main changes:
- Use -potenital[] instead of potential[] to conform to the usual
terminology.
- Use function parameter instead of #define commands to select pivot rule.
- Use much faster implementation for the candidate list pivot rule.
It is about 5-20 times faster now.
- Add a new pivot rule called "Limited Search" that is a modified
version of "Block Search". It is about 25 percent faster on rather
sparse graphs.
- By default "Limited Search" is used for sparse graphs and
"Block Search" is used otherwise. This combined method is the most
efficient on every input class.
- Change the name of private members to start with "_".
- Change the name of function parameters not to start with "_".
- Remove unnecessary documentation for private members.
- Many doc improvements.
kpeter [Mon, 18 Feb 2008 03:30:53 +0000] rev 2574
Improvements in CapacityScaling.
Main changes:
- Use -potenital[] instead of potential[] to conform to the usual
terminology.
- Change the name of private members to start with "_".
- Change the name of function parameters not to start with "_".
- Remove unnecessary documentation for private members.
- Doc improvements.
kpeter [Mon, 18 Feb 2008 03:30:12 +0000] rev 2573
Improvements in CycleCanceling.
Main changes:
- Use function parameter instead of #define commands to select negative
cycle detection method.
- Change the name of private members to start with "_".
- Change the name of function parameters not to start with "_".
- Remove unnecessary documentation for private members.
- Doc improvements.
ladanyi [Fri, 08 Feb 2008 11:58:32 +0000] rev 2572
Fix VPATH builds.
alpar [Fri, 08 Feb 2008 11:04:37 +0000] rev 2571
Hopefully fix all compilation errors.
alpar [Fri, 08 Feb 2008 10:42:38 +0000] rev 2570
Fix a silly typo
alpar [Fri, 08 Feb 2008 10:38:08 +0000] rev 2569
#include<cmath> -> #include<lemon/math.h>
alpar [Fri, 08 Feb 2008 10:18:55 +0000] rev 2568
Math constants + configure bugfix backported
from hg a315a588a20d and 761622e5ed4c
alpar [Fri, 08 Feb 2008 09:56:46 +0000] rev 2567
Update the server and the repository names to lemon.
alpar [Fri, 08 Feb 2008 09:52:48 +0000] rev 2566
Doc improvments backported from hg 9df0fe5e5109
kpeter [Tue, 05 Feb 2008 12:45:23 +0000] rev 2565
Bug fix in heap_test.cc.
kpeter [Tue, 05 Feb 2008 12:41:05 +0000] rev 2564
Several doc improvements and fixes in maps.h and concepts/maps.h.
kpeter [Tue, 05 Feb 2008 11:24:32 +0000] rev 2563
Small fixes in README.
kpeter [Tue, 05 Feb 2008 11:23:23 +0000] rev 2562
Improvements and fixes in dim2.h.
- Several doc improvements.
- Fix BoundingBox::operator& implementation.
kpeter [Tue, 05 Feb 2008 11:10:08 +0000] rev 2561
Translate Hungarian varible names and improve messages in dim_test.cc.
kpeter [Tue, 05 Feb 2008 11:03:55 +0000] rev 2560
Fix the rename script.
klao [Tue, 29 Jan 2008 03:39:05 +0000] rev 2559
grid_ugraph.h: fixed #18 (global functions inlined)
kpeter [Mon, 28 Jan 2008 11:42:46 +0000] rev 2558
Improved rename script to handle includes correctly.
alpar [Mon, 21 Jan 2008 15:35:55 +0000] rev 2557
Reveal an existing functionality in the documentation
kpeter [Sun, 13 Jan 2008 10:32:14 +0000] rev 2556
Cleanup in the minimum cost flow files.
The changes only affects the documentation and the look of the source codes.
kpeter [Sun, 13 Jan 2008 10:26:55 +0000] rev 2555
Reimplemented MinMeanCycle to be much more efficient.
The new version implements Howard's algorithm instead of Karp's algorithm and
it is at least 10-20 times faster on all the 40-50 random graphs we have tested.
alpar [Mon, 07 Jan 2008 17:07:40 +0000] rev 2554
Minor doc fix
alpar [Mon, 07 Jan 2008 13:09:48 +0000] rev 2553
Happy New Year to LEMON (+ better update-copyright-header script)
kpeter [Fri, 04 Jan 2008 00:47:08 +0000] rev 2552
Improved rename script to avoid "undirected digraph".
ladanyi [Mon, 31 Dec 2007 19:21:21 +0000] rev 2551
Include functional because of std::less.
deba [Sun, 30 Dec 2007 18:23:32 +0000] rev 2550
Changing degree of tournament tree
Bug fix in union find
Small efficiency improvment in bipartite matchings
deba [Sat, 29 Dec 2007 15:11:41 +0000] rev 2549
Test program for max weighted matchings
deba [Fri, 28 Dec 2007 11:00:51 +0000] rev 2548
Edmond's Blossom shrinking algroithm:
MaxWeightedMatching
MaxWeightedPerfectMatching
deba [Thu, 27 Dec 2007 13:40:16 +0000] rev 2547
Renaming state_enum to State
Removing "Type" suffix from typedefs
Moving implementation into the class definition
deba [Thu, 20 Dec 2007 15:21:22 +0000] rev 2546
Bug fix in erase
deba [Thu, 20 Dec 2007 15:13:06 +0000] rev 2545
Casting index to int
kpeter [Wed, 19 Dec 2007 22:23:28 +0000] rev 2544
Bug fix (Circulation interface changed).
alpar [Wed, 19 Dec 2007 09:16:22 +0000] rev 2543
Change the local variables lower case
deba [Mon, 17 Dec 2007 09:54:26 +0000] rev 2542
Bug fix
deba [Wed, 12 Dec 2007 13:35:55 +0000] rev 2541
Bug fix
deba [Tue, 11 Dec 2007 17:42:49 +0000] rev 2540
Avoiding warnings
deba [Tue, 11 Dec 2007 17:37:08 +0000] rev 2539
DynEdgeLookUp implementation based on splay trees
In general case it is slower than the static version, but it should not
refreshed on the change of the graph
deba [Mon, 10 Dec 2007 16:34:31 +0000] rev 2538
Bug fix in doc
deba [Mon, 10 Dec 2007 16:33:37 +0000] rev 2537
Using operation traits in dijkstra
kpeter [Fri, 07 Dec 2007 12:00:32 +0000] rev 2536
Modified rename script (BpGraph instead of Bigraph).
kpeter [Wed, 05 Dec 2007 13:03:19 +0000] rev 2535
Redesigned CapacityScaling algorithm with almost the same interface.
The new version does not use the ResidualGraphAdaptor for performance reasons.
Scaling can be enabled and disabled with a parameter of the run() function.
kpeter [Wed, 05 Dec 2007 12:57:24 +0000] rev 2534
Improved docs.
kpeter [Wed, 05 Dec 2007 01:43:02 +0000] rev 2533
Bug fixes.
kpeter [Tue, 04 Dec 2007 18:51:35 +0000] rev 2532
Bug fixes in the rename script.
deba [Tue, 04 Dec 2007 14:08:27 +0000] rev 2531
rename graphs script
deba [Tue, 04 Dec 2007 10:55:27 +0000] rev 2530
Reimplementation of Hao-Orlin algorithm
Little modifictaion in NagamochiIbaraki
More docs for minimum cut algorithms
deba [Fri, 30 Nov 2007 09:22:38 +0000] rev 2529
Minor changes
deba [Wed, 28 Nov 2007 18:05:49 +0000] rev 2528
Gomory-Hu tree algorithm
deba [Wed, 28 Nov 2007 18:01:38 +0000] rev 2527
bug fix
class without constructor error
deba [Wed, 28 Nov 2007 17:51:02 +0000] rev 2526
Redesign Circulation interface according to new flow interface
New greedy approach initialization
deba [Wed, 28 Nov 2007 17:40:41 +0000] rev 2525
Using linked elevator
It is conform to the Graph concept in that sense
the graph maps should not be ReferenceMap
deba [Wed, 28 Nov 2007 16:42:58 +0000] rev 2524
Bug fix resetting activeness of node at initialization
ladanyi [Tue, 27 Nov 2007 16:26:58 +0000] rev 2523
Fix warning when compiling with -Wall.
deba [Tue, 27 Nov 2007 15:41:43 +0000] rev 2522
Performance bug in Preflow
The initial relabeling moved each node to the lowest level
Doc bug fix
deba [Sun, 25 Nov 2007 22:56:44 +0000] rev 2521
Bugfix: using read-write map instead reference map
deba [Wed, 21 Nov 2007 18:19:20 +0000] rev 2520
Better solution
deba [Wed, 21 Nov 2007 13:35:10 +0000] rev 2519
Changed queue implementation
deba [Wed, 21 Nov 2007 13:34:38 +0000] rev 2518
Bugfix in min cut computation
kpeter [Tue, 20 Nov 2007 21:40:55 +0000] rev 2517
Small changes in the documentation.
deba [Tue, 20 Nov 2007 15:06:03 +0000] rev 2516
Nauty graph6 reader
deba [Sat, 17 Nov 2007 21:41:01 +0000] rev 2515
Changing max flow interface
deba [Sat, 17 Nov 2007 20:58:11 +0000] rev 2514
Redesign the maximum flow algorithms
Redesigned interface
Preflow changed to use elevator
Edmonds-Karp does not use the ResGraphAdaptor
Goldberg-Tarjan algorithm (Preflow with Dynamic Trees)
Dinitz-Sleator-Tarjan (Blocking flow with Dynamic Tree)
deba [Wed, 14 Nov 2007 17:53:08 +0000] rev 2513
Query the result value of an expression
deba [Wed, 14 Nov 2007 17:44:42 +0000] rev 2512
Elevator: slight changes in elevator interface
LinkedElevator: based on linked lists
deba [Wed, 14 Nov 2007 17:42:48 +0000] rev 2511
IntegerMap
deba [Wed, 14 Nov 2007 15:36:37 +0000] rev 2510
removing semicolon ftom the end of GRAPH_TYPEDEFS
kpeter [Wed, 14 Nov 2007 06:28:08 +0000] rev 2509
Small changes in the min. cost flow classes.
deba [Thu, 08 Nov 2007 14:21:28 +0000] rev 2508
Planar graph coloring
kpeter [Wed, 07 Nov 2007 21:52:57 +0000] rev 2507
Small bug fix.
deba [Tue, 30 Oct 2007 20:44:53 +0000] rev 2506
Change to new union-find interface
deba [Tue, 30 Oct 2007 20:21:10 +0000] rev 2505
Redesign interface of MaxMatching and UnionFindEnum
New class ExtendFindEnum
Faster MaxMatching
deba [Tue, 30 Oct 2007 10:51:07 +0000] rev 2504
Bug fix
alpar [Thu, 25 Oct 2007 16:57:43 +0000] rev 2503
Fix a typo that caused the failure of 'make dist'
deba [Wed, 24 Oct 2007 16:31:49 +0000] rev 2502
BpUGraphReader and Writer
deba [Sat, 20 Oct 2007 14:29:12 +0000] rev 2501
Forgotten images
deba [Fri, 19 Oct 2007 17:07:50 +0000] rev 2500
planar doxygen group
deba [Fri, 19 Oct 2007 16:24:31 +0000] rev 2499
Planar Grid Embedding
deba [Fri, 19 Oct 2007 15:21:07 +0000] rev 2498
Bug fix in undirected graphs (adding loops)
Bug fix in undirected edgesets (alteration notifying)
Redesigned undirected edgesets (like the smart or ugraph)
ladanyi [Fri, 19 Oct 2007 13:50:13 +0000] rev 2497
Build fix.
deba [Wed, 17 Oct 2007 12:46:14 +0000] rev 2496
setAll for iterable bool maps
ladanyi [Sat, 13 Oct 2007 08:48:07 +0000] rev 2495
Added the function isFinite(), and replaced the calls to finite() with it.
This was necessary because finite() is not a standard function. Neither can
we use its standard counterpart isfinite(), because it was introduced only
in C99, and therefore it is not supplied by all C++ implementations.
ladanyi [Fri, 12 Oct 2007 22:19:03 +0000] rev 2494
Makefile fix.
deba [Tue, 09 Oct 2007 17:46:06 +0000] rev 2493
Bad documentation
deba [Tue, 09 Oct 2007 17:13:17 +0000] rev 2492
Adding doc
deba [Tue, 09 Oct 2007 17:11:42 +0000] rev 2491
Documentation for lemon tools
deba [Tue, 09 Oct 2007 16:22:04 +0000] rev 2490
Minor bug fixes in documentation
deba [Tue, 09 Oct 2007 15:46:12 +0000] rev 2489
Bug fix and redesign StdMap
Improving map adaptors documentations
deba [Tue, 09 Oct 2007 09:36:54 +0000] rev 2488
Bug fix in MaxMatching
deba [Tue, 02 Oct 2007 14:20:04 +0000] rev 2487
Removing other occurences of cnt
deba [Tue, 02 Oct 2007 14:15:18 +0000] rev 2486
Doc bug fix
deba [Tue, 02 Oct 2007 12:34:43 +0000] rev 2485
New developers page
The participation period should be included
Bug fix in doc related to Graph concpets
Removing some todos!
alpar [Mon, 01 Oct 2007 19:23:16 +0000] rev 2484
make it compatible with current version of glpk
alpar [Mon, 01 Oct 2007 18:57:21 +0000] rev 2483
- Gamma distributon random variable.
- Test file for random.h
alpar [Mon, 01 Oct 2007 18:55:58 +0000] rev 2482
Missing header file added.
deba [Sun, 30 Sep 2007 19:19:33 +0000] rev 2481
Avoiding warnings
deba [Sun, 30 Sep 2007 19:14:33 +0000] rev 2480
Planarity checking and embedding
deba [Fri, 28 Sep 2007 12:42:14 +0000] rev 2479
Once again bug fix in significant bit calculation
deba [Fri, 28 Sep 2007 12:15:10 +0000] rev 2478
The same for unsigned radix sort
deba [Fri, 28 Sep 2007 12:14:18 +0000] rev 2477
Bug fix in most significant digit calculation
kpeter [Thu, 27 Sep 2007 13:04:06 +0000] rev 2476
Bug fixes in the documentation (mainly bad references).
deba [Wed, 26 Sep 2007 14:37:48 +0000] rev 2475
Generate tools documentation
kpeter [Wed, 19 Sep 2007 23:35:27 +0000] rev 2474
Small bug fixes and changes in the documentation.
kpeter [Sun, 16 Sep 2007 14:21:12 +0000] rev 2473
Small improvement in documentation.
kpeter [Sun, 16 Sep 2007 13:29:42 +0000] rev 2472
Missing header.
kpeter [Thu, 13 Sep 2007 22:06:54 +0000] rev 2471
Small changes in min. cost flow algorithms.
kpeter [Thu, 13 Sep 2007 22:05:32 +0000] rev 2470
Small bug fixes.
deba [Fri, 31 Aug 2007 08:40:49 +0000] rev 2469
Invalid assignments ambiguity handling
deba [Tue, 28 Aug 2007 14:13:40 +0000] rev 2468
More simple interface for PathDumper
deba [Tue, 28 Aug 2007 14:00:42 +0000] rev 2467
PathNodeIt
PathWriter/Reader structures
Distinict MapSet readers and writers
deba [Tue, 28 Aug 2007 13:58:54 +0000] rev 2466
Redesign of augmenting path based matching
Small bug fix in the push-relabel based
ladanyi [Sat, 25 Aug 2007 10:12:03 +0000] rev 2465
Consider the CPXMIP_OPTIMAL_TOL status as OPTIMAL too.
deba [Fri, 24 Aug 2007 14:32:55 +0000] rev 2464
uedgeset is an alias for edgeset
deba [Tue, 21 Aug 2007 13:22:21 +0000] rev 2463
Query functions: aMatching and bMatching
Modified algorithm function interfaces
ANodeMap<UEdge> matching map
BNodeMap<bool> barrier map
Consistency between augmenting path and push-relabel algorithm
deba [Sat, 11 Aug 2007 16:34:41 +0000] rev 2462
Common interface for bipartite matchings
Some useful query function for push-relabel based matching
The naming should be rethink for these classes
for example: pr-ap prefix for push-relabel and augmenting path
algorithms
deba [Thu, 26 Jul 2007 13:59:12 +0000] rev 2461
Reporting invalid ID
deba [Thu, 26 Jul 2007 12:18:02 +0000] rev 2460
Correction in the line numbering method
deba [Thu, 05 Jul 2007 16:39:42 +0000] rev 2459
Sample input for sat-2 and sat demos
deba [Tue, 26 Jun 2007 14:02:08 +0000] rev 2458
The mip column addition hack is necessary only for 4.16
deba [Fri, 15 Jun 2007 14:36:24 +0000] rev 2457
Improvments in min cost flow algorithms
- improved cycle cancelling
deba [Fri, 15 Jun 2007 14:32:48 +0000] rev 2456
Space reservation for SmartGraph
Doc improvments
deba [Fri, 15 Jun 2007 14:31:14 +0000] rev 2455
Using set() instead of assignment
alpar [Tue, 12 Jun 2007 14:34:28 +0000] rev 2454
Spellcheck
deba [Thu, 07 Jun 2007 20:07:29 +0000] rev 2453
Correction for multiple point on starting sweep line
alpar [Tue, 05 Jun 2007 17:30:52 +0000] rev 2452
Update the demo file of Circulation
alpar [Tue, 05 Jun 2007 17:29:46 +0000] rev 2451
Two new constructors added to dim2::BoundingBox
alpar [Tue, 05 Jun 2007 17:27:54 +0000] rev 2450
Negate the meaning of the delta parameter
alpar [Tue, 05 Jun 2007 17:24:35 +0000] rev 2449
Minor improvement in Tutorial
alpar [Tue, 05 Jun 2007 14:48:20 +0000] rev 2448
Bugfix and improvement in -tsp2 algorithm
deba [Tue, 05 Jun 2007 11:49:19 +0000] rev 2447
Delaunay triangulation
Faster geometric minimum spanning tree
alpar [Tue, 05 Jun 2007 10:59:16 +0000] rev 2446
A minimum spanning tree based TSP algorithm is added (-tsp2)
alpar [Tue, 05 Jun 2007 10:57:26 +0000] rev 2445
- Fix a serious bug in UEulerIt
- Add a conversion to UEdge
- Make some member funtions to be 'const'
deba [Fri, 11 May 2007 16:03:20 +0000] rev 2444
Patch in network simplex
Patch from Peter Kovacs
deba [Fri, 11 May 2007 16:02:53 +0000] rev 2443
Patch for retrieving reached/processed node in dijkstra, bfs and dfs
Patch from Peter Kovacs
deba [Thu, 10 May 2007 14:56:05 +0000] rev 2442
Bug fix
deba [Mon, 07 May 2007 18:19:55 +0000] rev 2441
Conformity to new GLPK interface
Hacking Mip without integer variables
deba [Mon, 07 May 2007 11:42:18 +0000] rev 2440
Various min cost flow solvers
Patch from Peter Kovacs
deba [Mon, 07 May 2007 08:49:57 +0000] rev 2439
Modified start() function in Dfs and Dijkstra classes to give back reached
edge/node.
Patch from Peter Kovacs
deba [Mon, 07 May 2007 08:48:40 +0000] rev 2438
Bug fix in Bfs class.
Patch from Peter Kovacs
deba [Mon, 07 May 2007 08:47:38 +0000] rev 2437
Small improvements in MinMeanCycle class.
Patch from Peter Kovacs
alpar [Tue, 24 Apr 2007 09:39:01 +0000] rev 2436
Integer parameters also convert to double
alpar [Fri, 20 Apr 2007 17:26:38 +0000] rev 2435
Fix the bug
alpar [Fri, 20 Apr 2007 17:24:05 +0000] rev 2434
Test the repository checking service
alpar [Fri, 20 Apr 2007 16:22:03 +0000] rev 2433
Fix the test bug
ladanyi [Fri, 20 Apr 2007 15:53:06 +0000] rev 2432
Sorry...
ladanyi [Fri, 20 Apr 2007 15:51:54 +0000] rev 2431
fix to compile with gcc 4.1.2
alpar [Fri, 20 Apr 2007 14:50:42 +0000] rev 2430
Test broken repository warning
deba [Fri, 20 Apr 2007 14:49:21 +0000] rev 2429
Renaming topology doxygen group
deba [Fri, 20 Apr 2007 14:47:19 +0000] rev 2428
Doc change
deba [Fri, 20 Apr 2007 14:06:08 +0000] rev 2427
Clear for unionfinds
deba [Thu, 19 Apr 2007 15:14:34 +0000] rev 2426
Allowing 'string' type quoting
deba [Thu, 19 Apr 2007 15:12:59 +0000] rev 2425
Helper classs for checking existence of a nested class
deba [Thu, 19 Apr 2007 15:11:58 +0000] rev 2424
Redesigned Kruskal algorithm
The interface of function type implementation is not changed
Additional class type implementation
deba [Thu, 19 Apr 2007 15:09:08 +0000] rev 2423
Corrections on StoreBoolMap
- *insert_iterator has void value_type
- use const setting
deba [Thu, 19 Apr 2007 15:07:03 +0000] rev 2422
Doc fix
deba [Wed, 18 Apr 2007 16:35:04 +0000] rev 2421
Small changes
deba [Wed, 18 Apr 2007 16:34:40 +0000] rev 2420
Demo program for SAT problems
ladanyi [Wed, 11 Apr 2007 07:34:40 +0000] rev 2419
Added SimplePath::front().
athos [Tue, 10 Apr 2007 09:01:30 +0000] rev 2418
Slight modifications.
deba [Fri, 06 Apr 2007 22:50:27 +0000] rev 2417
Parameter reordering
Patch from Kovacs Peter
deba [Fri, 30 Mar 2007 14:17:28 +0000] rev 2416
Small improvments
athos [Tue, 27 Mar 2007 09:23:33 +0000] rev 2415
I only corrected bugs to make things compile: some featured not implemented here yet.
deba [Mon, 26 Mar 2007 10:44:03 +0000] rev 2414
Bug fix
Wrong renaming
deba [Thu, 22 Mar 2007 15:40:50 +0000] rev 2413
Right dimacs format for min cost flows
Bug fixes in tolerance and min_mean_cycle
ladanyi [Thu, 22 Mar 2007 06:36:50 +0000] rev 2412
Append the svn revision number to the version string automatically.
deba [Wed, 14 Mar 2007 18:58:33 +0000] rev 2411
Bug fix
deba [Wed, 14 Mar 2007 18:01:04 +0000] rev 2410
dim_to_lgf
- use the argparser class
arg_parser improvments
- usage of assert in cc
- const char** argv
error
- handling the string parameter
alpar [Tue, 13 Mar 2007 16:32:35 +0000] rev 2409
Minimum mean cycle algorithm contributed by Peter Kovacs.
alpar [Tue, 13 Mar 2007 15:42:06 +0000] rev 2408
Doc improvements contributed by Peter Kovacs.
alpar [Tue, 13 Mar 2007 15:35:56 +0000] rev 2407
Using LEMON_ASSERT instead of LogicError()
alpar [Tue, 13 Mar 2007 12:33:40 +0000] rev 2406
Better doc.
deba [Mon, 12 Mar 2007 15:00:33 +0000] rev 2405
Missing template keyword bug
alpar [Mon, 12 Mar 2007 13:57:53 +0000] rev 2404
dim_to_lgf has been moved to tools/ (from demo/)
alpar [Mon, 12 Mar 2007 13:45:50 +0000] rev 2403
The lemon repository has been renamed
alpar [Mon, 12 Mar 2007 13:26:56 +0000] rev 2402
An improved version of ArgParser: You don't need to give an explicit storage
for each option.
TODO: Documentation must be updated
deba [Wed, 07 Mar 2007 13:32:12 +0000] rev 2401
Data hiding
Const members
deba [Wed, 07 Mar 2007 12:00:59 +0000] rev 2400
Steiner 2-approximation demo
deba [Wed, 07 Mar 2007 11:57:51 +0000] rev 2399
More query functions
deba [Wed, 07 Mar 2007 11:57:23 +0000] rev 2398
Little interface improvment
deba [Wed, 07 Mar 2007 11:56:53 +0000] rev 2397
Some design correction
deba [Wed, 07 Mar 2007 11:56:14 +0000] rev 2396
naming convention:
header sentry
deba [Tue, 06 Mar 2007 17:04:16 +0000] rev 2395
Correction of urls and email addresses
deba [Tue, 06 Mar 2007 17:03:37 +0000] rev 2394
Bug fix missing include
deba [Tue, 06 Mar 2007 16:57:15 +0000] rev 2393
Bug fix
from Kovacs Peter
deba [Mon, 05 Mar 2007 17:10:58 +0000] rev 2392
Bug whit Parent typedef in SplitGraphAdaptor::CombinedEdgeMap
Fixing graph to eps parameters for demo
alpar [Sat, 03 Mar 2007 16:30:37 +0000] rev 2391
Happy New Year to all source files!
alpar [Sat, 03 Mar 2007 16:04:50 +0000] rev 2390
- '-Wshadow' seemed to strict therefore removed
- a tools directory added for useful executables codes
- tools/lgf-gen.cc (a random graph generator) added
alpar [Sat, 03 Mar 2007 12:05:05 +0000] rev 2389
arg_parser.h: A command line argument parser.
dist_log.h: A tool for measuring one and two dimensional distributions.
alpar [Sat, 03 Mar 2007 12:00:32 +0000] rev 2388
More doc.
alpar [Sat, 03 Mar 2007 11:57:07 +0000] rev 2387
Fix icc compilation failures
deba [Fri, 02 Mar 2007 18:04:28 +0000] rev 2386
Hard Warning checking
- based on the remark of the ZIB user
- we do not use -Winline
deba [Fri, 02 Mar 2007 17:56:22 +0000] rev 2385
Bug fix
Setting _pred in init()
deba [Thu, 01 Mar 2007 17:14:24 +0000] rev 2384
getNotifier to notifier renaming
deba [Thu, 01 Mar 2007 16:50:12 +0000] rev 2383
steiner.h into the makefile
deba [Thu, 01 Mar 2007 16:47:49 +0000] rev 2382
2-approximation of Steiner-tree problem
deba [Thu, 01 Mar 2007 16:47:23 +0000] rev 2381
Bug fix
alpar [Thu, 01 Mar 2007 16:04:12 +0000] rev 2380
ball2() -> disc() renaming
alpar [Thu, 01 Mar 2007 16:03:36 +0000] rev 2379
Prescaling can be turned off
deba [Wed, 21 Feb 2007 13:51:45 +0000] rev 2378
Once again minor doc changes
deba [Wed, 21 Feb 2007 13:49:19 +0000] rev 2377
Minor changes
deba [Wed, 21 Feb 2007 13:30:21 +0000] rev 2376
Reorganization of the modules and groups
alpar [Tue, 20 Feb 2007 15:53:33 +0000] rev 2375
A preflow based general network circulation algorithm and a simple demo
alpar [Tue, 20 Feb 2007 13:01:22 +0000] rev 2374
Some two dimensional random distribution added.
They should be revised.
alpar [Tue, 20 Feb 2007 12:55:37 +0000] rev 2373
Doc improvements
deba [Mon, 19 Feb 2007 19:55:13 +0000] rev 2372
Adding original license to the file
+ buffered bit generation
deba [Mon, 19 Feb 2007 19:54:28 +0000] rev 2371
Minor fix
deba [Mon, 19 Feb 2007 18:56:11 +0000] rev 2370
Some documentation changes
deba [Mon, 19 Feb 2007 18:21:28 +0000] rev 2369
Naming convention changes
setObj => obj
is_min => isMin
is_max => isMax
deba [Mon, 19 Feb 2007 12:11:41 +0000] rev 2368
Bug fixes
Documentation
alpar [Mon, 19 Feb 2007 09:55:43 +0000] rev 2367
More adequate doc.
deba [Fri, 16 Feb 2007 19:11:31 +0000] rev 2366
Using const in lp interface
colByName functionality
alpar [Fri, 16 Feb 2007 15:57:48 +0000] rev 2365
Check Soplex support, as well
deba [Thu, 15 Feb 2007 19:15:14 +0000] rev 2364
Lp row and col getter function
lp section reader and writer for lemon IO
deba [Thu, 15 Feb 2007 14:22:08 +0000] rev 2363
Changes on the LP interface
_FixId => LpId
- handling of not common ids // soplex
LpGlpk row and col erase bug fix
- calling lpx_std_basis before simplex
LpSoplex
- added getter functions
- better m4 file
- integration to the tests
- better handling of unsolved lps
deba [Thu, 15 Feb 2007 13:06:23 +0000] rev 2362
Small changes
athos [Wed, 14 Feb 2007 13:50:25 +0000] rev 2361
Implemented virtual functions of class LpCplex.
alpar [Mon, 12 Feb 2007 17:54:36 +0000] rev 2360
Lagrange relaxation based algorithm for the delay constrained least cost
path problem.
deba [Mon, 12 Feb 2007 10:27:03 +0000] rev 2359
Some spellcheck
deba [Mon, 12 Feb 2007 10:25:56 +0000] rev 2358
Dijkstra could return the temporarly distance of the current node
deba [Sun, 11 Feb 2007 16:34:51 +0000] rev 2357
Some bug fix
RevIt => RevEdgeIt renaming
alpar [Wed, 07 Feb 2007 18:07:10 +0000] rev 2356
Further doc improvements
alpar [Tue, 06 Feb 2007 19:16:26 +0000] rev 2355
Two new distributions added:
- Gaussian distribution generated using the polar form of the Box-Muller
transformation,
- Exponential distribution generated using inverse cdf.
alpar [Tue, 06 Feb 2007 19:09:17 +0000] rev 2354
Doc improvements
alpar [Thu, 25 Jan 2007 14:38:55 +0000] rev 2353
A push/relabel type max cardinality matching implementation.
(slightly incompatible with bipartite_matching.h)
alpar [Thu, 25 Jan 2007 14:36:21 +0000] rev 2352
Doc improvements
deba [Tue, 23 Jan 2007 13:13:39 +0000] rev 2351
Correction of the wrong base class
alpar [Tue, 23 Jan 2007 12:51:39 +0000] rev 2350
Several doc improvements.
athos [Mon, 22 Jan 2007 12:13:57 +0000] rev 2349
Small bug corrected.
alpar [Mon, 22 Jan 2007 10:22:14 +0000] rev 2348
- Some bugfixes
- Better doc
- liftToTop(), liftTo() added
alpar [Fri, 19 Jan 2007 17:27:22 +0000] rev 2347
Spellcheck
alpar [Fri, 19 Jan 2007 17:15:15 +0000] rev 2346
elevator.h: A class for handling item labels in push-relabel type algorithms
athos [Fri, 12 Jan 2007 16:29:06 +0000] rev 2345
One important thing only: equality-type constraint can now be added to an lp. The prettyPrint functions are not too pretty yet, I accept.
deba [Thu, 11 Jan 2007 22:08:18 +0000] rev 2344
Bug fix
deba [Thu, 11 Jan 2007 21:58:30 +0000] rev 2343
G++-3.3 conform solution
deba [Thu, 11 Jan 2007 21:35:14 +0000] rev 2342
Bug fix
deba [Thu, 11 Jan 2007 21:27:51 +0000] rev 2341
Undirected minimum cut benchmarking
deba [Thu, 11 Jan 2007 21:22:39 +0000] rev 2340
Make Hao-Orlin epsilon-safe
deba [Thu, 11 Jan 2007 21:20:57 +0000] rev 2339
Bug fix
deba [Thu, 11 Jan 2007 21:06:47 +0000] rev 2338
Changing implementation of undirected graphs
slightly faster, 10% speed-up
deba [Thu, 11 Jan 2007 21:05:00 +0000] rev 2337
Adding two heuristics
Based on:
http://www.avglab.com/andrew/pub/neci-tr-96-132.ps
athos [Tue, 09 Jan 2007 11:42:43 +0000] rev 2336
Nothing serious.
deba [Mon, 08 Jan 2007 10:39:59 +0000] rev 2335
New path concept and path structures
TODO: BellmanFord::negativeCycle()
athos [Fri, 05 Jan 2007 10:59:18 +0000] rev 2334
I only corrected some errors in the documentation.
deba [Tue, 19 Dec 2006 15:53:42 +0000] rev 2333
MACROS for debug map usage
deba [Tue, 19 Dec 2006 14:00:43 +0000] rev 2332
Bug fix
deba [Mon, 18 Dec 2006 14:35:33 +0000] rev 2331
Easier inverse than m.inverse()[a] => m(a)
deba [Mon, 18 Dec 2006 10:12:07 +0000] rev 2330
Better handling of inexact computation.
We do not use tolerance for excess, just for edges
deba [Tue, 12 Dec 2006 13:35:52 +0000] rev 2329
clone => build renaming
athos [Thu, 07 Dec 2006 16:10:54 +0000] rev 2328
Query functions have been implemented for GLPK (CPLEX breaks at the moment, I guess): These functions include:
retrieving one element of the coeff. matrix
retrieving one element of the obj function
lower bd for a variable
upper bound for a variable
lower and upper bounds for a row (these can not be handled separately at the moment)
direction of the optimization (is_max() function)
alpar [Mon, 04 Dec 2006 18:09:09 +0000] rev 2327
More sophisticated warning messages.
alpar [Mon, 04 Dec 2006 18:08:30 +0000] rev 2326
Fix 'unused variable' warnings
athos [Mon, 04 Dec 2006 16:51:46 +0000] rev 2325
Oops. I did not mean to break the repository.
athos [Mon, 04 Dec 2006 16:48:13 +0000] rev 2324
Some query functions got implemented, but only for GLPK.