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.
alpar [Mon, 04 Dec 2006 15:00:24 +0000] rev 2323
Check for gcc version 3.3, 3.4 and 4.0 as well
alpar [Mon, 04 Dec 2006 14:29:58 +0000] rev 2322
Send the output to /dev/null
alpar [Mon, 04 Dec 2006 13:13:14 +0000] rev 2321
Copy constructor for LpGlpk
alpar [Thu, 30 Nov 2006 16:40:09 +0000] rev 2320
Automatic doc generation from the SVN trunk
alpar [Thu, 30 Nov 2006 14:42:18 +0000] rev 2319
- Change the subjects of broken repository mail alerts.
- Do not send the log file to the list
alpar [Thu, 30 Nov 2006 14:38:18 +0000] rev 2318
Send broken repository alert also to lemon-commits@lemon.cs.elte.hu.
alpar [Thu, 30 Nov 2006 13:43:49 +0000] rev 2317
Put server services related scripts under the server-services folder.
deba [Wed, 29 Nov 2006 17:35:31 +0000] rev 2316
Lp section reader
deba [Wed, 29 Nov 2006 17:34:29 +0000] rev 2315
Configuration files for soplex
deba [Wed, 29 Nov 2006 17:32:03 +0000] rev 2314
checking soplex
deba [Wed, 29 Nov 2006 17:30:21 +0000] rev 2313
Preliminary soplex support
deba [Wed, 29 Nov 2006 15:01:13 +0000] rev 2312
modified _setColCoeff and _setRowCoeff parameters
const simplify() for expressions
alpar [Tue, 28 Nov 2006 17:25:22 +0000] rev 2311
make 'commit-checker' silent
alpar [Tue, 28 Nov 2006 17:15:50 +0000] rev 2310
- update graph_oriantation.cc to be in line with the renamed xy and with the
new graphToEps() scaling.
- Fix and external directory build problem in Doxyfile.in
alpar [Tue, 28 Nov 2006 12:36:51 +0000] rev 2309
Make the constructors of ColIt public.
deba [Fri, 24 Nov 2006 14:24:43 +0000] rev 2308
Erasing unionfind Item template parameter
deba [Tue, 21 Nov 2006 18:29:31 +0000] rev 2307
Some doc fix
deba [Tue, 21 Nov 2006 18:22:08 +0000] rev 2306
BfsVisitor
Bipartite partitions based on visitors
topology_demo.cc => scaleToA4 works without extra parameters
deba [Tue, 21 Nov 2006 17:28:08 +0000] rev 2305
Keeping order of alteration observers
Removing some automatic callback generation
// exception safety reason
ladanyi [Mon, 20 Nov 2006 10:14:21 +0000] rev 2304
Doc fix.
alpar [Tue, 14 Nov 2006 09:49:26 +0000] rev 2303
ColIt added. (Untested, but at least it compiles.)
alpar [Mon, 13 Nov 2006 18:58:39 +0000] rev 2302
Test the automatic compilation checker 1/2: fix the repo again
alpar [Mon, 13 Nov 2006 18:46:19 +0000] rev 2301
Test the automatic compilation checker 1/2: make a bug
deba [Mon, 13 Nov 2006 12:30:59 +0000] rev 2300
Conditional execution until the target is reached
/previous implementation: until the target is the next to process/
todo: query the target when we give nodemap as condition
alpar [Thu, 09 Nov 2006 00:50:07 +0000] rev 2299
Bugfix: didn't removed the lock file if something went wrong
alpar [Thu, 09 Nov 2006 00:23:26 +0000] rev 2298
Test the automatic compilation checker 3/3: fix repo again
alpar [Thu, 09 Nov 2006 00:19:53 +0000] rev 2297
Test the automatic compilation checker 2/3: wrong commit
alpar [Thu, 09 Nov 2006 00:14:15 +0000] rev 2296
Test the automatic compilation checker 1/3
alpar [Wed, 08 Nov 2006 23:40:08 +0000] rev 2295
Send message to the commit author, as well
alpar [Wed, 08 Nov 2006 23:28:14 +0000] rev 2294
Script for automatic checking of SVN commit's consistency
deba [Fri, 03 Nov 2006 16:29:32 +0000] rev 2293
First implementation of the static graph class
It could be improved to get better running times on benchmarks
deba [Fri, 03 Nov 2006 15:21:52 +0000] rev 2292
General mapping based variant type
deba [Fri, 03 Nov 2006 14:24:44 +0000] rev 2291
Spellchecking
deba [Fri, 03 Nov 2006 14:20:24 +0000] rev 2290
GraphCopy and UGraphCopy modifications
Preliminary support for static graphs
=> cloning graphs
Added BpUGraphCopy
Tests for graph copies
deba [Fri, 03 Nov 2006 14:14:05 +0000] rev 2289
Strict checking disabled
athos [Tue, 31 Oct 2006 15:57:53 +0000] rev 2288
Corrected some typos and grammatical errors.
deba [Tue, 31 Oct 2006 14:56:13 +0000] rev 2287
Removing template Map template parameter from InvertableMaps
deba [Tue, 31 Oct 2006 14:41:12 +0000] rev 2286
The implementation of the graph copy is changed
Make explicit more constructors
deba [Tue, 31 Oct 2006 14:31:13 +0000] rev 2285
Bug fix
deba [Tue, 31 Oct 2006 14:30:54 +0000] rev 2284
Renaming MinCut
deba [Tue, 31 Oct 2006 14:28:27 +0000] rev 2283
Bug fix
deba [Tue, 31 Oct 2006 14:27:58 +0000] rev 2282
Bug fixes
mqrelly [Tue, 31 Oct 2006 09:32:44 +0000] rev 2281
tutorial update
algorithms, and graph visualisation
alpar [Tue, 31 Oct 2006 08:46:18 +0000] rev 2280
One more refinement
alpar [Tue, 31 Oct 2006 08:39:01 +0000] rev 2279
Update scripts
alpar [Tue, 31 Oct 2006 08:32:28 +0000] rev 2278
update for version 0.6
alpar [Tue, 31 Oct 2006 08:28:55 +0000] rev 2277
icpc-9.0 compilation bugfix
deba [Mon, 30 Oct 2006 17:22:14 +0000] rev 2276
Min cost flow is renamed to SspMinCostFlow
athos [Mon, 30 Oct 2006 16:26:13 +0000] rev 2275
Small bugs in the documentation 2.
alpar [Mon, 30 Oct 2006 16:19:18 +0000] rev 2274
Turn off 32 bit only tests, cont'd.
athos [Mon, 30 Oct 2006 16:12:44 +0000] rev 2273
Small bugs in the documentation.
alpar [Mon, 30 Oct 2006 15:29:50 +0000] rev 2272
Turn off 32 bit only tests.
alpar [Mon, 30 Oct 2006 15:23:35 +0000] rev 2271
repository cleanup
alpar [Mon, 30 Oct 2006 12:25:43 +0000] rev 2270
- Add an autopackage generator script for glpk
- update autopackage specfile
deba [Mon, 30 Oct 2006 12:07:52 +0000] rev 2269
Bug fix for removing heap Item from template parameter list
athos [Mon, 30 Oct 2006 12:01:51 +0000] rev 2268
ColName() -> colName(), Coeff() -> coeff()
athos [Mon, 30 Oct 2006 11:32:19 +0000] rev 2267
LEMON_INTEGER -> INT
hegyi [Fri, 27 Oct 2006 15:19:33 +0000] rev 2266
NEWS updated to Rel0.6 - according to Alpar's instruction, at last
hegyi [Fri, 27 Oct 2006 15:08:58 +0000] rev 2265
NEWS updated to Rel0.6
athos [Fri, 27 Oct 2006 12:39:13 +0000] rev 2264
A little test was born for Expr::simplify().
mqrelly [Thu, 26 Oct 2006 14:20:17 +0000] rev 2263
Bug #46 fixed: Superfluous template parameter in Heap concept
NOTE: Not every affected file tested.
alpar [Thu, 26 Oct 2006 13:35:35 +0000] rev 2262
concept -> concepts cont'd
alpar [Thu, 26 Oct 2006 06:54:13 +0000] rev 2261
Doc update
alpar [Tue, 24 Oct 2006 17:19:16 +0000] rev 2260
concept -> concepts (namespace & directory)
alpar [Tue, 24 Oct 2006 16:49:41 +0000] rev 2259
Spellcheck
alpar [Sun, 22 Oct 2006 19:45:57 +0000] rev 2258
Docfix.
maps.h is still very fuzzy.
alpar [Fri, 20 Oct 2006 12:06:49 +0000] rev 2257
Doc improvements.
alpar [Fri, 20 Oct 2006 12:05:54 +0000] rev 2256
Graph imlementations actually provide ReferenceMaps.
deba [Wed, 18 Oct 2006 15:18:27 +0000] rev 2255
It have not been saved
deba [Wed, 18 Oct 2006 15:05:12 +0000] rev 2254
Some improvements on item readers and writers
alpar [Tue, 17 Oct 2006 11:05:23 +0000] rev 2253
Remove superfluous #ifndef boundaries
alpar [Tue, 17 Oct 2006 11:02:30 +0000] rev 2252
A trial to make the last test platform independent.
deba [Tue, 17 Oct 2006 11:02:05 +0000] rev 2251
Documentation for UndirGraphAdaptor
alpar [Tue, 17 Oct 2006 11:01:35 +0000] rev 2250
Compilation warning resolved.
alpar [Tue, 17 Oct 2006 11:01:19 +0000] rev 2249
Compilation warning resolved.
deba [Tue, 17 Oct 2006 11:01:16 +0000] rev 2248
SimpleMap and SimpleWriteMap
- Trivial adaptors, but they are useful in some case
Some combined maps will be reference map if the first
template parameter map is reference map or not. If I want
to give a refernce map as first map but there is a non
reference map parameter then I should wrap my first map
to a regular read-write map.
deba [Tue, 17 Oct 2006 10:50:57 +0000] rev 2247
Update the Path concept
Concept check for paths
DirPath renamed to Path
The interface updated to the new lemon interface
Make difference between the empty path and the path from one node
Builder interface have not been changed
// I wanted but there was not accordance about it
UPath is removed
It was a buggy implementation, it could not iterate on the
nodes in the right order
Right way to use undirected paths => path of edges in undirected graphs
The tests have been modified to the current implementation
deba [Tue, 17 Oct 2006 10:42:19 +0000] rev 2246
Documentation is moved to source file
deba [Tue, 17 Oct 2006 10:40:28 +0000] rev 2245
Little modification on interface and documentation
alpar [Tue, 17 Oct 2006 10:32:12 +0000] rev 2244
Benchmark the running time of lemon::Random
alpar [Tue, 17 Oct 2006 10:31:20 +0000] rev 2243
Change for better measurement very fast operations (enable a higher
number of iterations in runningTimeTest())
deba [Sat, 14 Oct 2006 15:26:05 +0000] rev 2242
New random interface
Switching to the new interface
alpar [Fri, 13 Oct 2006 15:10:50 +0000] rev 2241
Improve build environment and scripts
alpar [Thu, 12 Oct 2006 11:54:30 +0000] rev 2240
Turn off 32bit specific tests.
alpar [Thu, 12 Oct 2006 11:53:31 +0000] rev 2239
Turn off 32bit specific tests.
alpar [Thu, 12 Oct 2006 11:09:17 +0000] rev 2238
Bugfix
alpar [Thu, 12 Oct 2006 10:56:26 +0000] rev 2237
Improve the configuration environment / repository layout:
- Update README
- svn-head -> svnhead version tag change (in favor of rpm build)
- rpmbuild-glpk: a script to build glpk rpm.
alpar [Thu, 12 Oct 2006 10:53:49 +0000] rev 2236
EdgeLookUp and AllEdgeLookUp tests added.
alpar [Thu, 12 Oct 2006 10:53:25 +0000] rev 2235
EdgeLookUp and AllEdgeLookUp added.
alpar [Thu, 12 Oct 2006 10:51:51 +0000] rev 2234
Minor change in 'make rpm' behaviour.
alpar [Tue, 10 Oct 2006 13:50:47 +0000] rev 2233
docfix
alpar [Thu, 05 Oct 2006 10:18:58 +0000] rev 2232
Fix a bug and two warnings
deba [Tue, 03 Oct 2006 11:46:39 +0000] rev 2231
Some rearrangement of concepts and extenders
BpUGraph concepts and concept check test
deba [Tue, 03 Oct 2006 11:24:41 +0000] rev 2230
Some doc fix
deba [Mon, 02 Oct 2006 16:11:00 +0000] rev 2229
Mersenne Twister random number generator
The code is based on the official MT19937 implementation
It is fully rewritten:
http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/emt.html
todo: fixing copyright information
athos [Mon, 02 Oct 2006 14:41:53 +0000] rev 2228
Improved documentation.
deba [Mon, 02 Oct 2006 12:09:32 +0000] rev 2227
include just the existing solvers
athos [Mon, 02 Oct 2006 11:18:30 +0000] rev 2226
MIP interface tested (and corrected) for cplex 9.0
deba [Fri, 29 Sep 2006 11:36:30 +0000] rev 2225
Doc fix
deba [Fri, 29 Sep 2006 11:26:29 +0000] rev 2224
Moving the file into correct group
deba [Fri, 29 Sep 2006 11:25:27 +0000] rev 2223
Exporting interface to the Graph class
Some documentation improvements
deba [Fri, 29 Sep 2006 11:23:54 +0000] rev 2222
findEdge extension also for the BpUGraphs
proper handling of loop edges in the UGraph::findUEdge
athos [Tue, 26 Sep 2006 12:20:22 +0000] rev 2221
Minor changes.
athos [Mon, 25 Sep 2006 08:51:08 +0000] rev 2220
Too many files added: sorry.
athos [Mon, 25 Sep 2006 08:50:36 +0000] rev 2219
Missing cplex files: sorry.
athos [Thu, 21 Sep 2006 14:46:28 +0000] rev 2218
Interface to the cplex MIP solver: it is little, a bit sour but it is ours.
deba [Thu, 14 Sep 2006 19:58:29 +0000] rev 2217
Doc fix
alpar [Thu, 14 Sep 2006 19:11:24 +0000] rev 2216
The recent progresses on the tutorial due to Mark.
alpar [Thu, 14 Sep 2006 19:02:52 +0000] rev 2215
Fix another one external build problem.
alpar [Thu, 14 Sep 2006 18:39:07 +0000] rev 2214
Doc improvements
athos [Fri, 08 Sep 2006 15:51:32 +0000] rev 2213
Some corrections.
deba [Fri, 08 Sep 2006 08:55:07 +0000] rev 2212
Some small improvments
size() and subscription operators
compatibility with higher dimensions
deba [Thu, 07 Sep 2006 14:16:47 +0000] rev 2211
Hao-Orlin algorithm
It is based on Attila's work
It is tested on all dimacs files in data directory
It may need more execution control
- possible interruption after each findNewSink
deba [Thu, 07 Sep 2006 14:04:31 +0000] rev 2210
Add missing header sentry
alpar [Thu, 07 Sep 2006 13:35:48 +0000] rev 2209
Resolve 'unused variable' warning
alpar [Thu, 07 Sep 2006 13:34:14 +0000] rev 2208
Revert an unintentional commit in r2933
alpar [Thu, 07 Sep 2006 13:27:16 +0000] rev 2207
xy -> dim2::Point
deba [Wed, 06 Sep 2006 11:39:22 +0000] rev 2206
I forgot to remove the benchmarking part of code
deba [Wed, 06 Sep 2006 11:17:12 +0000] rev 2205
UnionFind
Changing the representation of the union-find
it has the same running time but it takes just 2/3 space
! does not auto insert items /performance/
UnionFindEnum
Changing the interface - more convenient to UnionFind
Does not based on the stl data structures /it could be disadvantage/
=> does not use singular iterator assignment /not stl conform, but always work/
Just new iterator interface
MaxMatching + UnionFindTest
Using new iterator interface instead of the old
deba [Wed, 06 Sep 2006 10:28:13 +0000] rev 2204
Some doc fix
deba [Wed, 06 Sep 2006 10:20:55 +0000] rev 2203
Signaling alterations in BpUGraphs
deba [Wed, 06 Sep 2006 10:19:57 +0000] rev 2202
New map type based on array map for debugging purpose
It checks multiple allocation and deallocation of map values and
some consistency.
todo:
clarification of debugging concepts
assertions - exceptions - debug
revision of attic/debug.h
motto:
testing is at least so important as coding
deba [Wed, 06 Sep 2006 10:10:48 +0000] rev 2201
Bug fix in DescriptorMap
Avoiding the possibility of the memory leak
deba [Wed, 06 Sep 2006 10:01:15 +0000] rev 2200
An easy avoiding of a bug
The functional interfaces are removed.
Better solution could be a reference counted core of the io interfaces
Now it is huge work so just write that:
GraphReader<ListGraph>(std::cin, graph).
Instead of:
graphReader(std::cin, graph).
deba [Wed, 06 Sep 2006 09:55:37 +0000] rev 2199
Bug fix
deba [Wed, 06 Sep 2006 09:54:46 +0000] rev 2198
Using abort() instead of exit(1)
If a program is aborted then the call stack can be analyzed with debugger.
The exit(1) does not provides that.
alpar [Wed, 06 Sep 2006 08:36:52 +0000] rev 2197
Disable mip_test when no LP solver is available.
alpar [Mon, 04 Sep 2006 20:07:37 +0000] rev 2196
Add missing Tutorial dox files
alpar [Mon, 04 Sep 2006 19:48:09 +0000] rev 2195
Tutorial improvements by Mark (mqrelly)
alpar [Mon, 04 Sep 2006 19:12:44 +0000] rev 2194
'make doc' is now working also in case of external build.
deba [Mon, 04 Sep 2006 12:27:03 +0000] rev 2193
Bug fix in SmartEdgeSet
+ validity check function
deba [Mon, 04 Sep 2006 12:15:20 +0000] rev 2192
Bug fix
rethrow of exception missing
deba [Mon, 04 Sep 2006 11:09:59 +0000] rev 2191
Proper exception handling in the SmartEdgeSet
deba [Mon, 04 Sep 2006 11:09:13 +0000] rev 2190
Snapshot for SmartUGraph an SmartBpUGraph
deba [Mon, 04 Sep 2006 11:08:32 +0000] rev 2189
Bug fix in ListBpUGraph
Snapshot improvments
deba [Mon, 04 Sep 2006 11:05:21 +0000] rev 2188
Improvment in exception handling
The erase and clear handlers have to be exception safe.
These can throw only one exception which detach the observer
from the notifier
deba [Mon, 04 Sep 2006 11:02:31 +0000] rev 2187
Bug fix in UndirGraphAdaptor
deba [Mon, 04 Sep 2006 11:01:56 +0000] rev 2186
Bug fix in countANodes/countBNodes
athos [Wed, 30 Aug 2006 16:08:03 +0000] rev 2185
Fixed the mip error (mipstatus was incorrect).
alpar [Mon, 28 Aug 2006 16:11:02 +0000] rev 2184
Doc improvementst & todos
alpar [Mon, 28 Aug 2006 16:10:12 +0000] rev 2183
Update header list
ladanyi [Mon, 28 Aug 2006 15:43:17 +0000] rev 2182
bezier.h is no longer in the repository.
deba [Mon, 14 Aug 2006 16:14:10 +0000] rev 2181
Omit warnings
deba [Mon, 14 Aug 2006 16:08:28 +0000] rev 2180
Omit warning
Using check instead of the LEMON_ASSERT
Using fixed graph
alpar [Mon, 14 Aug 2006 15:18:09 +0000] rev 2179
Remove superfluous include headers
alpar [Mon, 14 Aug 2006 15:15:57 +0000] rev 2178
- bezier.h went to lemon/bits/
- new graphToEps() option: absolute/relative node size/link width scaling.
deba [Fri, 11 Aug 2006 14:55:33 +0000] rev 2177
BiVariant moved to lemon/bits/variant.h
deba [Fri, 11 Aug 2006 14:55:02 +0000] rev 2176
Doc fix
alpar [Thu, 10 Aug 2006 13:54:01 +0000] rev 2175
Doc improvements
alpar [Thu, 10 Aug 2006 13:52:56 +0000] rev 2174
Some color constants added (BLACK, WHITE, RED etc)
alpar [Thu, 10 Aug 2006 12:26:29 +0000] rev 2173
Resolve unused variable warning.
alpar [Thu, 10 Aug 2006 10:18:04 +0000] rev 2172
- Change ColorSet to Palette
- Minor change in graph_orientation demo.
alpar [Thu, 10 Aug 2006 10:11:07 +0000] rev 2171
This script creates/updates the copyright header of a source file
alpar [Wed, 09 Aug 2006 12:51:21 +0000] rev 2170
Do not list the header itself.
alpar [Wed, 09 Aug 2006 12:47:31 +0000] rev 2169
This script lists all the header files included directly or indirectly by a certain header file.
ladanyi [Wed, 02 Aug 2006 20:15:59 +0000] rev 2168
CPLEX 9.x support.
ladanyi [Wed, 02 Aug 2006 20:15:22 +0000] rev 2167
Fixed the mailinglist link and removed the gui section.
ladanyi [Tue, 01 Aug 2006 10:26:15 +0000] rev 2166
More "doxygenish" syntax.
ladanyi [Thu, 27 Jul 2006 11:49:15 +0000] rev 2165
Maybe useful, feel free to remove if not.
deba [Mon, 24 Jul 2006 16:15:48 +0000] rev 2164
long long just for gnu compilers
deba [Mon, 24 Jul 2006 16:08:34 +0000] rev 2163
Improving UGraph and BpUGraph concept classes
deba [Mon, 24 Jul 2006 09:51:28 +0000] rev 2162
make public what() in NodeSetError
deba [Mon, 24 Jul 2006 09:50:40 +0000] rev 2161
Omit warning
deba [Mon, 24 Jul 2006 09:49:50 +0000] rev 2160
Change source and target for the bipartite list graph
Some documentation corrections
alpar [Mon, 24 Jul 2006 08:11:00 +0000] rev 2159
Minor doc improvement
alpar [Thu, 20 Jul 2006 14:12:01 +0000] rev 2158
Minor doc improvement
alpar [Thu, 20 Jul 2006 06:20:27 +0000] rev 2157
- Doc improvements
- rot180() added to xy.h
alpar [Wed, 19 Jul 2006 15:13:24 +0000] rev 2156
spellcheck
alpar [Tue, 18 Jul 2006 17:00:24 +0000] rev 2155
Minor doc changes.
alpar [Tue, 18 Jul 2006 16:59:34 +0000] rev 2154
Tolerance<unsigned int> and Tolerance<unsigned long long int> added.
alpar [Tue, 18 Jul 2006 15:57:55 +0000] rev 2153
Better 'Naming Convention' conformance.
alpar [Tue, 18 Jul 2006 15:14:56 +0000] rev 2152
Bugfix
alpar [Tue, 18 Jul 2006 13:29:59 +0000] rev 2151
exceptionName() has been thrown away
deba [Tue, 18 Jul 2006 12:10:52 +0000] rev 2150
Disable assertions in default behaviour
Documentation changed
athos [Tue, 18 Jul 2006 11:11:54 +0000] rev 2149
Some tests added to the test file mip_test.cc. One problem is the verbosity of the mip solver in glpk which I couldn't find how to kill.
athos [Mon, 17 Jul 2006 11:56:17 +0000] rev 2148
Modifications to the interface: colType() functions, though I left the old integer() functions, too.
athos [Mon, 17 Jul 2006 09:31:41 +0000] rev 2147
mip_test file went to mip_demo.
athos [Mon, 17 Jul 2006 09:16:00 +0000] rev 2146
Still not final.
athos [Mon, 17 Jul 2006 09:10:19 +0000] rev 2145
Sorry, mistake
athos [Mon, 17 Jul 2006 09:00:21 +0000] rev 2144
MIP support added (by Jano, the Great).
alpar [Mon, 17 Jul 2006 07:30:56 +0000] rev 2143
Even better...
athos [Mon, 17 Jul 2006 07:00:39 +0000] rev 2142
Some documentation got changed.
alpar [Fri, 14 Jul 2006 13:48:14 +0000] rev 2141
reference to modules added
alpar [Fri, 14 Jul 2006 13:11:18 +0000] rev 2140
Minor comment added.
alpar [Fri, 14 Jul 2006 10:51:14 +0000] rev 2139
Some updates and restructuring
alpar [Fri, 14 Jul 2006 10:50:05 +0000] rev 2138
glemon is in a separate repository.
deba [Fri, 14 Jul 2006 10:25:26 +0000] rev 2137
Using fixed bipartite graph
deba [Fri, 14 Jul 2006 09:37:48 +0000] rev 2136
Bug fix in MinCostMaxBipartiteMatching
The augmenting phase have not changed the
unreached nodes' potential which caused invalid
dual solution in some cases
alpar [Wed, 12 Jul 2006 11:40:52 +0000] rev 2135
Must have been changed because of the private copy constructor.
alpar [Wed, 12 Jul 2006 11:14:12 +0000] rev 2134
... and fix another one.
alpar [Wed, 12 Jul 2006 11:07:48 +0000] rev 2133
... and fix a stupid bug.
alpar [Wed, 12 Jul 2006 11:05:00 +0000] rev 2132
(Hopefully) finish privatizing the copy constr. and operator= in
the graph concept, ListGraph and SmartGraph.
ladanyi [Wed, 12 Jul 2006 10:49:17 +0000] rev 2131
New, less general installation instructions.
deba [Wed, 12 Jul 2006 10:38:11 +0000] rev 2130
Resolving: Bug #51
deba [Wed, 12 Jul 2006 10:34:07 +0000] rev 2129
Resolving: Bug #52
alpar [Tue, 11 Jul 2006 16:09:49 +0000] rev 2128
- Disable the copy constructor and operator= of {List|Smart}[U]Graph.
- Improve graph doc
- Also put private members into the doc (if they are documented)
ladanyi [Tue, 11 Jul 2006 15:50:19 +0000] rev 2127
Do not install the documentation if configure was called with --disable-doc.
deba [Tue, 11 Jul 2006 15:42:15 +0000] rev 2126
Renameing file: graph_component.h => graph_components.h
ladanyi [Tue, 11 Jul 2006 14:42:06 +0000] rev 2125
Removed references to the gui.
alpar [Tue, 11 Jul 2006 13:54:02 +0000] rev 2124
Use sed instead of rpl
alpar [Tue, 11 Jul 2006 13:51:52 +0000] rev 2123
Minor doc improvements
hegyi [Tue, 11 Jul 2006 12:37:53 +0000] rev 2122
README version one is added.
deba [Mon, 10 Jul 2006 19:04:17 +0000] rev 2121
Modifications in the Graph Component concepts
alpar [Wed, 05 Jul 2006 16:59:45 +0000] rev 2120
As we agreed, Node/Edge::operator<() is required by the concept
ladanyi [Tue, 04 Jul 2006 19:06:47 +0000] rev 2119
Distribute Makefiles.
ladanyi [Tue, 04 Jul 2006 18:53:24 +0000] rev 2118
Distribute Doxyfile.in and lemon.pc.in.
alpar [Tue, 04 Jul 2006 17:49:01 +0000] rev 2117
- Revised "Concepts" group documentation
- Other minor doc improvements
deba [Fri, 30 Jun 2006 12:15:45 +0000] rev 2116
Revert splitted files
deba [Fri, 30 Jun 2006 12:14:36 +0000] rev 2115
Splitted graph files
deba [Wed, 28 Jun 2006 16:27:44 +0000] rev 2114
new snapshot
deba [Wed, 28 Jun 2006 15:38:45 +0000] rev 2113
Some modification in the documentation.
deba [Wed, 28 Jun 2006 15:28:38 +0000] rev 2112
Make explicit constructors
deba [Wed, 28 Jun 2006 15:06:24 +0000] rev 2111
Removing concepts for extendable and erasable graphs
Renaming StaticGraph to Graph
deba [Mon, 26 Jun 2006 15:40:35 +0000] rev 2110
Smaller Simple Bucket Heap
- the list node does not store the value
- trade off: linear time operator[]
ladanyi [Thu, 22 Jun 2006 18:34:35 +0000] rev 2109
Set svn:ignore property.
ladanyi [Thu, 22 Jun 2006 18:20:25 +0000] rev 2108
Single makefile.
deba [Thu, 22 Jun 2006 15:16:11 +0000] rev 2107
Added reserveNode function.
ladanyi [Wed, 21 Jun 2006 11:15:01 +0000] rev 2106
Set props.
ladanyi [Wed, 21 Jun 2006 08:42:01 +0000] rev 2105
Moved the po directory to glemon/trunk.
ladanyi [Wed, 21 Jun 2006 08:39:28 +0000] rev 2104
Moved the gui to glemon/trunk.
ladanyi [Wed, 21 Jun 2006 08:35:23 +0000] rev 2103
Exclude the gui from the build.
athos [Tue, 20 Jun 2006 15:20:08 +0000] rev 2102
Slight changes in doc.
deba [Mon, 19 Jun 2006 13:44:06 +0000] rev 2101
Improvement:
The item sets are written in the order sorted by the labels.
It solves the problem if we read a graph from a file and
then write it back then the nodes will be reversed.
It can be switched off with the LemonWriter interface.
deba [Tue, 06 Jun 2006 12:47:01 +0000] rev 2100
Doc bug fix
readed => read
klao [Wed, 31 May 2006 16:48:31 +0000] rev 2099
benchmark: radix_sort-bench was not compiled
deba [Tue, 30 May 2006 10:33:50 +0000] rev 2098
Bug fix in the list bipartite undirected graph
ladanyi [Sun, 21 May 2006 22:18:57 +0000] rev 2097
Gettext is needed for bootstrapping.
deba [Thu, 18 May 2006 16:13:44 +0000] rev 2096
Bug fix
alpar [Thu, 18 May 2006 10:24:14 +0000] rev 2095
Bugfix
alpar [Thu, 18 May 2006 09:32:36 +0000] rev 2094
Spellcheck
deba [Thu, 18 May 2006 08:12:54 +0000] rev 2093
Erasing some code from the examples
deba [Thu, 18 May 2006 08:04:51 +0000] rev 2092
Erasing unused parameter names
Omitting Warning
deba [Thu, 18 May 2006 08:04:00 +0000] rev 2091
Functor usage for writeable map adaptors
Documentation for writeable map adaptors
alpar [Wed, 17 May 2006 11:05:34 +0000] rev 2090
Docfix
deba [Wed, 17 May 2006 09:07:24 +0000] rev 2089
SimpleBucketHeap added
It does not supports erasing, decreasing, increasing.
It contains single linked lists
It can be used to store levels for push-relabel algorithms
alpar [Wed, 17 May 2006 05:54:24 +0000] rev 2088
Fix Bug #45: Missing include
deba [Tue, 16 May 2006 17:13:42 +0000] rev 2087
DirUGraphAdaptor documentation
alpar [Tue, 16 May 2006 16:59:57 +0000] rev 2086
Polinomial template class
deba [Mon, 15 May 2006 16:21:50 +0000] rev 2085
Bug fix by Jano
deba [Mon, 15 May 2006 09:49:51 +0000] rev 2084
Documentation improvements
Rearrangements:
IO modules
Algorithms
New documentation:
SwapBpUGraphAdaptor
Demos:
strongly_connected_orientation.cc
Benchmarks:
swap_bipartite_bench.cc
deba [Mon, 15 May 2006 09:46:33 +0000] rev 2083
Writing only not empty sections
deba [Mon, 15 May 2006 09:44:35 +0000] rev 2082
Bug fix
deba [Fri, 12 May 2006 15:29:42 +0000] rev 2081
New demo file for computing disjoint paths
Doc review
Correcting misformatting in adaptors
Adding header to demos
deba [Fri, 12 May 2006 09:57:03 +0000] rev 2080
Bug fix
deba [Fri, 12 May 2006 09:56:14 +0000] rev 2079
Remade SplitGraphAdaptor
deba [Fri, 12 May 2006 09:54:58 +0000] rev 2078
Revised Compile Time Arithmetic
deba [Fri, 12 May 2006 09:52:28 +0000] rev 2077
Two state Variant
+ Some Compile Time arithmetic
deba [Fri, 12 May 2006 09:51:45 +0000] rev 2076
Extenders modified
UGraphBaseExtender => UndirGraphExtender
BpUGraphBaseExtender merged into BpUGraphExtender
athos [Tue, 09 May 2006 14:28:02 +0000] rev 2075
Fixed typos.
deba [Tue, 09 May 2006 11:25:34 +0000] rev 2074
Bug fix
Do not delete the not constructed map
alpar [Tue, 09 May 2006 09:23:39 +0000] rev 2073
- fix bug #43: static and const in Tolerance class
- fix return value of nonZero()
alpar [Tue, 09 May 2006 09:21:48 +0000] rev 2072
Create a separate group for matrices
alpar [Tue, 09 May 2006 09:21:02 +0000] rev 2071
Also install .gif files.
deba [Mon, 08 May 2006 17:03:52 +0000] rev 2070
Getting Negative Cycle
deba [Fri, 05 May 2006 10:48:58 +0000] rev 2069
Bug fix: Using set instead reference assignment
ladanyi [Tue, 02 May 2006 18:23:42 +0000] rev 2068
gLEMON does not compile with gtkmm 2.4.x
deba [Thu, 27 Apr 2006 14:53:23 +0000] rev 2067
Tabu Search by Szabadkai Mark
ladanyi [Thu, 27 Apr 2006 13:10:23 +0000] rev 2066
added scrollbars to the canvas
ladanyi [Thu, 27 Apr 2006 12:20:09 +0000] rev 2065
filter loop edges
deba [Tue, 25 Apr 2006 14:48:50 +0000] rev 2064
Bug fix in findUEdge
ladanyi [Tue, 18 Apr 2006 22:59:33 +0000] rev 2063
id->label
alpar [Tue, 18 Apr 2006 13:25:41 +0000] rev 2062
Also check mingw compatibility
deba [Tue, 18 Apr 2006 09:14:38 +0000] rev 2061
Bug fix
Add missing function
deba [Tue, 18 Apr 2006 07:03:12 +0000] rev 2060
Images into the algorithm groups
deba [Tue, 18 Apr 2006 07:02:32 +0000] rev 2059
Doc fix
deba [Tue, 18 Apr 2006 07:01:55 +0000] rev 2058
Refinements in bipartite matching algorithms
ladanyi [Fri, 14 Apr 2006 23:55:36 +0000] rev 2057
added missing glibc2.m4
ladanyi [Fri, 14 Apr 2006 22:01:02 +0000] rev 2056
downgrade to gettext 0.14.2
ladanyi [Fri, 14 Apr 2006 18:53:56 +0000] rev 2055
po update
ladanyi [Fri, 14 Apr 2006 18:35:55 +0000] rev 2054
bugfix
ladanyi [Fri, 14 Apr 2006 18:31:50 +0000] rev 2053
distribute m4/*.m4
ladanyi [Fri, 14 Apr 2006 18:31:16 +0000] rev 2052
some reorganization
deba [Fri, 14 Apr 2006 18:07:33 +0000] rev 2051
MaxWeightedBipartiteMatching
MinCostMaxBipartiteMatching
Both algorithms are based on successive shortest
path algorithm with dijkstra shortest path
finding
deba [Fri, 14 Apr 2006 18:05:02 +0000] rev 2050
Changing the mining of the clear in heaps
It does not touch the heap cross ref. It is
sometimes more clean useable and more efficient
ladanyi [Fri, 14 Apr 2006 15:05:51 +0000] rev 2049
bugfix
ladanyi [Fri, 14 Apr 2006 14:57:59 +0000] rev 2048
make distcheck should work now
ladanyi [Thu, 13 Apr 2006 18:09:34 +0000] rev 2047
Removed a 0x00 byte which confused the file utility.
klao [Thu, 13 Apr 2006 17:57:03 +0000] rev 2046
more explicit :)
klao [Thu, 13 Apr 2006 17:22:17 +0000] rev 2045
path.h: bugfix, returning reference to a temporary
ladanyi [Wed, 12 Apr 2006 20:50:35 +0000] rev 2044
svn:ignore
ladanyi [Wed, 12 Apr 2006 20:38:22 +0000] rev 2043
revert to single configure scheme
deba [Fri, 07 Apr 2006 09:54:35 +0000] rev 2042
New Algorithm group for matchings
LaTeX formulas
Bug fix => ///\f$ will cause parsing error in doxygen
deba [Fri, 07 Apr 2006 09:52:30 +0000] rev 2041
Forgotten functions in the graph adaptor extenders.
deba [Fri, 07 Apr 2006 09:51:23 +0000] rev 2040
Bipartite Graph Max Cardinality Matching (Hopcroft-Karp)
Test for it
Some BpUgraph improvments
deba [Thu, 06 Apr 2006 09:33:29 +0000] rev 2039
Commiting The DynamicAsymMatrixMap from Nagy Jano
+ MatrixMapTraits
deba [Tue, 04 Apr 2006 17:45:35 +0000] rev 2038
LinearHeap is renamed to BucketHeap which is more conform
and widely used name for this data structure
deba [Tue, 04 Apr 2006 17:43:23 +0000] rev 2037
Doxygen log corrections
doc of ResGraphAdaptor has a bug in graph_adaptor.h
deba [Tue, 04 Apr 2006 10:40:02 +0000] rev 2036
The algorithm does not change the capacity and the flow in the resgraph
deba [Mon, 03 Apr 2006 19:47:37 +0000] rev 2035
More mingw compatibility
Implementation of the drand48 functions
deba [Mon, 03 Apr 2006 16:34:23 +0000] rev 2034
Edmonds-Karp MaxFlow
ResGraphAdaptor with Tolerance
deba [Mon, 03 Apr 2006 16:05:26 +0000] rev 2033
Small corrections
deba [Mon, 03 Apr 2006 16:03:37 +0000] rev 2032
Writeable extension of some maps
deba [Mon, 03 Apr 2006 09:45:23 +0000] rev 2031
Correcting the structure of the graph's and adaptor's map.
The template assign operators and map iterators can be used for adaptors also.
Some bugfix in the adaptors
New class SwapBpUGraphAdaptor which swaps the two nodeset of the graph.
deba [Mon, 03 Apr 2006 09:24:38 +0000] rev 2030
Naming convention fix
deba [Mon, 03 Apr 2006 08:41:52 +0000] rev 2029
Count ANodes-BNodes
deba [Fri, 31 Mar 2006 12:51:44 +0000] rev 2028
MinGW32 compatibility
deba [Fri, 31 Mar 2006 12:12:06 +0000] rev 2027
MinGW compatibility fix
deba [Fri, 31 Mar 2006 12:04:48 +0000] rev 2026
NaN checking to be conform to MinGW32
deba [Fri, 31 Mar 2006 11:10:44 +0000] rev 2025
Bugfix in the minimum cost arborescence algorithm
Dual solution computation and interface for algorithm
Optimality test on random graph
jacint [Thu, 30 Mar 2006 15:34:56 +0000] rev 2024
tolerance class incorporated
jacint [Thu, 30 Mar 2006 15:02:11 +0000] rev 2023
Unionfind changes induced some bugs here. Also some augmentations made.
alpar [Thu, 30 Mar 2006 09:42:05 +0000] rev 2022
docfix
deba [Thu, 30 Mar 2006 09:36:33 +0000] rev 2021
IncEdgeIt goes through on loop edges twice.
deba [Thu, 30 Mar 2006 08:38:41 +0000] rev 2020
Rewritten countItems and findEdges
deba [Mon, 27 Mar 2006 16:25:14 +0000] rev 2019
Adding todo to preflow
Some naming convention renamings
klao [Mon, 27 Mar 2006 16:09:54 +0000] rev 2018
missing ignore
deba [Mon, 27 Mar 2006 08:12:01 +0000] rev 2017
Minimum Cost Arborescence algorithm
deba [Mon, 27 Mar 2006 08:01:10 +0000] rev 2016
Doc rearrangement
Section readers moved to own group
klao [Fri, 24 Mar 2006 20:27:42 +0000] rev 2015
bootstrap: quiet option
ladanyi [Thu, 23 Mar 2006 20:43:25 +0000] rev 2014
ignore generated files
ladanyi [Thu, 23 Mar 2006 20:42:37 +0000] rev 2013
include fixes
ladanyi [Thu, 23 Mar 2006 19:57:14 +0000] rev 2012
- added gettext infrastructure to the gui
- the gui has a separate configure script now
- other minor changes
deba [Tue, 21 Mar 2006 13:45:24 +0000] rev 2011
Renaming files
klao [Fri, 17 Mar 2006 15:54:02 +0000] rev 2010
unused parameters fix
klao [Thu, 16 Mar 2006 13:52:12 +0000] rev 2009
rethrow fix
alpar [Wed, 15 Mar 2006 09:45:59 +0000] rev 2008
"Node shapes" added
alpar [Wed, 15 Mar 2006 09:45:10 +0000] rev 2007
Also check gcc-4.1
alpar [Wed, 15 Mar 2006 09:44:17 +0000] rev 2006
Spellcheck
klao [Fri, 10 Mar 2006 19:34:47 +0000] rev 2005
unionfind_test: double erase is not supported anymore
klao [Fri, 10 Mar 2006 18:17:37 +0000] rev 2004
UnionFindEnum: one remaining bug; removing commented out code
klao [Fri, 10 Mar 2006 18:06:26 +0000] rev 2003
UnionFindEnum revision:
* 0 is _not_ convertible to list<...>::iterator, so we have to use other means
to define/check validity
* standard LEMON iterator interface for ClassIt and ItemIt
deba [Wed, 08 Mar 2006 13:10:43 +0000] rev 2002
Omitting warning
deba [Tue, 07 Mar 2006 11:06:57 +0000] rev 2001
Removing obsolote "id" map handling
Error message is modified
deba [Mon, 06 Mar 2006 17:32:35 +0000] rev 2000
Checking missing section reader
deba [Mon, 06 Mar 2006 10:28:37 +0000] rev 1999
Clarifing alteration observing system
It is directly connected now to a container
deba [Mon, 06 Mar 2006 09:38:19 +0000] rev 1998
Bugfix in the hyper map
klao [Fri, 03 Mar 2006 21:49:39 +0000] rev 1997
Bugfix: an ugly artefact of the 'id' -> 'label' renaming
deba [Fri, 03 Mar 2006 12:35:32 +0000] rev 1996
Some documentation arrangement modification
deba [Thu, 02 Mar 2006 14:22:03 +0000] rev 1995
Bugfix in bpugraph
klao [Wed, 01 Mar 2006 17:37:25 +0000] rev 1994
bugfix: moving "invalid.h" down to "bits" broke autoconf
deba [Wed, 01 Mar 2006 13:19:28 +0000] rev 1993
utility, invalid and traits moved to bits
deba [Wed, 01 Mar 2006 12:46:52 +0000] rev 1992
UNDIRGRAPH_TYPEDEFS => UGRAPH_TYPEDEFS
deba [Wed, 01 Mar 2006 10:25:30 +0000] rev 1991
The graph adadptors can be alteration observed.
In most cases it uses the adapted graph alteration notifiers.
Only special case is now the UndirGraphAdaptor, where
we have to proxy the signals from the graph.
The SubBidirGraphAdaptor is removed, because it doest not
gives more feature than the EdgeSubGraphAdaptor<UndirGraphAdaptor<Graph>>.
The ResGraphAdaptor is based on this composition.
deba [Wed, 01 Mar 2006 10:17:25 +0000] rev 1990
Some classes assumed that the GraphMaps should be inherited
from an ObserverBase. These classes parents replaced with
DefaultMap which cause that the graph maps should not be
inherited from the ObserverBase.
deba [Wed, 01 Mar 2006 10:04:47 +0000] rev 1989
Traits for alteration notifiers
SplitGraph is temporarly deleted
deba [Wed, 01 Mar 2006 09:40:16 +0000] rev 1988
Bug fix
deba [Mon, 27 Feb 2006 15:43:25 +0000] rev 1987
Default constructor which allocates empty graphs
deba [Mon, 27 Feb 2006 10:36:01 +0000] rev 1986
An additional simplier interface for static size graphs.
Node operator()(int) for getting node by index
int index(Node node) for getting index by node
deba [Mon, 27 Feb 2006 10:17:33 +0000] rev 1985
Bug fix
deba [Fri, 24 Feb 2006 11:13:09 +0000] rev 1984
Bug fix
deba [Fri, 24 Feb 2006 11:02:11 +0000] rev 1983
Bugfix
deba [Thu, 23 Feb 2006 15:10:45 +0000] rev 1982
ListBpUGraph
deba [Thu, 23 Feb 2006 09:03:18 +0000] rev 1981
Little bugfixes, spellchecks and improvements
deba [Thu, 23 Feb 2006 08:55:54 +0000] rev 1980
Renaming to be convient to the naming of the adaptors
Concept checking of the ugraph adaptors
deba [Wed, 22 Feb 2006 18:26:56 +0000] rev 1979
Mergeing extendermerge branch
Changes:
the extender system
resize for static size graph
UGraphExtender => UndirectGraphExtender
UGraphExtenders with changed meaning
Some UGraphExtender /SubUGraphExtenders, DirectUGraphExtender/
GridGraph => GridUGraph
radix sort to ansi compatible
alpar [Wed, 22 Feb 2006 12:45:59 +0000] rev 1978
vmap.h: Enables one to create maps with a virtual base class.
alpar [Tue, 21 Feb 2006 12:37:00 +0000] rev 1977
RefPtr: a reference counted pointer class
alpar [Tue, 21 Feb 2006 08:48:11 +0000] rev 1976
Fix bug #26: Check if an edge is a loop and do not draw then
deba [Mon, 20 Feb 2006 09:40:07 +0000] rev 1975
Second renaming of min cut
Minimum => Min
Work => Aux
alpar [Mon, 20 Feb 2006 06:44:07 +0000] rev 1974
Public data members of xy became documented
alpar [Mon, 20 Feb 2006 06:43:08 +0000] rev 1973
Spellchecking
alpar [Mon, 20 Feb 2006 06:42:29 +0000] rev 1972
Dewarningification
alpar [Mon, 20 Feb 2006 06:41:12 +0000] rev 1971
- RGB color related stuff is in color.h now
- eps.h: A simple class to create .eps figures (demo: eps_demo.h)
alpar [Mon, 20 Feb 2006 06:38:18 +0000] rev 1970
Doc changes
alpar [Mon, 20 Feb 2006 06:32:15 +0000] rev 1969
One more step towards Undir -> U conversion...
deba [Tue, 14 Feb 2006 10:41:16 +0000] rev 1968
Name modification
deba [Mon, 13 Feb 2006 09:42:53 +0000] rev 1967
New algorithm:
MaxCardinalitySearch
MinimalCut // in UGraph
deba [Tue, 07 Feb 2006 09:32:55 +0000] rev 1966
Easier checking in DEBUG mode
I hope we should not test ArrayMap longer
The vector map checks its limits in debug mode what
helps us to find the bad memory accesses in the maps
deba [Tue, 07 Feb 2006 09:20:47 +0000] rev 1965
Compilation with G++ -ansi
deba [Mon, 06 Feb 2006 20:32:29 +0000] rev 1964
Bug fix
deba [Mon, 06 Feb 2006 17:00:41 +0000] rev 1963
Bug fix
deba [Mon, 06 Feb 2006 16:58:39 +0000] rev 1962
Bug fixes in ListEdgeSet
Added SmartEdgeSet
deba [Mon, 06 Feb 2006 15:52:32 +0000] rev 1961
Bug fix
alpar [Mon, 06 Feb 2006 09:11:53 +0000] rev 1960
- Increased max. number of iteration
- Better tests.
alpar [Mon, 06 Feb 2006 09:10:43 +0000] rev 1959
Spellcheck
alpar [Fri, 03 Feb 2006 17:32:25 +0000] rev 1958
- svn lock doesn't work
- fix bootstrap switch
alpar [Fri, 03 Feb 2006 17:21:21 +0000] rev 1957
Last struggle against Doxygen.
alpar [Fri, 03 Feb 2006 16:40:16 +0000] rev 1956
Unified copyright notices
alpar [Fri, 03 Feb 2006 16:11:08 +0000] rev 1955
Change the compilation flag at release make distcheck.
(This setting is probably indifferent, though.)
alpar [Fri, 03 Feb 2006 16:00:36 +0000] rev 1954
Minor change.
alpar [Fri, 03 Feb 2006 15:58:24 +0000] rev 1953
Polish the doc.
klao [Fri, 03 Feb 2006 14:22:45 +0000] rev 1952
graph_adaptor.h: spacing corrections in doc
klao [Fri, 03 Feb 2006 14:07:52 +0000] rev 1951
graph_adaptor.h: probably a doxygen bug: in tex formulas there should be
whitespace after the opening and before the closing \f$
klao [Fri, 03 Feb 2006 12:20:10 +0000] rev 1950
lp_cplex.cc: bugfix in _setColName, _getColName implemented
alpar [Fri, 03 Feb 2006 09:18:17 +0000] rev 1949
Fight with Doxygen.
Victory hasn't been reached yet, but it's on the horizon.
alpar [Fri, 03 Feb 2006 09:03:05 +0000] rev 1948
Hopefully we can release 0.5 today
alpar [Thu, 02 Feb 2006 18:13:18 +0000] rev 1947
minor changes
alpar [Thu, 02 Feb 2006 17:43:24 +0000] rev 1946
- workaround for a Doxygen 1.4.6 bug
- other doc fixes
klao [Thu, 02 Feb 2006 17:09:09 +0000] rev 1945
NEWS: major changes since 0.4 added
alpar [Thu, 02 Feb 2006 15:53:01 +0000] rev 1944
Use short icpc paths
ladanyi [Thu, 02 Feb 2006 15:44:45 +0000] rev 1943
Fix crash when an arrow is clicked with the delete tool.
klao [Thu, 02 Feb 2006 13:43:01 +0000] rev 1942
kruskal.h: an overloaded function for older, pointer-style iterators
alpar [Thu, 02 Feb 2006 08:52:20 +0000] rev 1941
The version tag of the trunk is svn-head
alpar [Thu, 02 Feb 2006 08:51:10 +0000] rev 1940
- also works off-line
- icc-8.0 in (not) tested, as well.
alpar [Thu, 02 Feb 2006 08:49:41 +0000] rev 1939
Towards icc-8.0 compatibility...
alpar [Wed, 01 Feb 2006 12:55:38 +0000] rev 1938
Fix g++-3.4 executable's name
alpar [Wed, 01 Feb 2006 11:33:16 +0000] rev 1937
Some useful scripts:
check-compiler: test whether the repo compiles warningless
with various compilers.
check-integrity: checks whether everything is svn-added,
the makefiles are correct etc.
release: creates a version numbered release. Is modifies the repository.
DO NOT PLAY WITH IT!
alpar [Tue, 31 Jan 2006 21:14:11 +0000] rev 1936
Fix icc compilation failures.
alpar [Tue, 31 Jan 2006 20:16:53 +0000] rev 1935
Spellcheck
deba [Tue, 31 Jan 2006 20:14:52 +0000] rev 1934
Bug fix
ANodeIt/BNodeIt should not be inherited from ANode/BNode
The reason:
assert(graph.id(ANodeIt(graph)) == graph.id((Node)ANodeIt(graph)));
deba [Tue, 31 Jan 2006 20:04:36 +0000] rev 1933
Revising the bpugraph concept
We need a public but very limited ANode and BNode class
It can be used with ItemSetTraits and with some special maps
By example:
DescriptorMap<Graph, ANode>
InvertableMap<Graph, ANode, string>
IterableBoolMap<Graph, ANode>
IterableIntMap<Graph, ANode>
IterableValueMap<Graph, ANode, string>
deba [Tue, 31 Jan 2006 19:57:35 +0000] rev 1932
Bug fix
friend does not declares type
deba [Tue, 31 Jan 2006 19:33:48 +0000] rev 1931
New iterable map with comparable values
it uses linked lists and balanced binary tree
IterableBoolMap has ItemIt type as the other iterable maps
InvertableMap got ValueIterator
alpar [Mon, 30 Jan 2006 09:37:41 +0000] rev 1930
Solve bug #23: Floating versus Integer Coordinates
- BoundingBox values rounds to integer
- The generated .eps rescales if the bounding box were too small otherwise.
alpar [Mon, 30 Jan 2006 09:32:52 +0000] rev 1929
Better doc.
alpar [Mon, 30 Jan 2006 09:32:26 +0000] rev 1928
Use [] instead of set().
alpar [Mon, 30 Jan 2006 09:31:15 +0000] rev 1927
Functions added to set the edges/corners of the bounding box directly.
ladanyi [Sun, 29 Jan 2006 23:46:05 +0000] rev 1926
Do not rely on the autodetection of cplex and glpk.
ladanyi [Sun, 29 Jan 2006 23:32:46 +0000] rev 1925
Updated rpm specfile to include the gui too. Couldn't test it.
ladanyi [Sun, 29 Jan 2006 22:50:55 +0000] rev 1924
ignore radix_sort-bench
ladanyi [Sun, 29 Jan 2006 22:41:55 +0000] rev 1923
distribute simann.h too
ladanyi [Sun, 29 Jan 2006 22:21:37 +0000] rev 1922
Undir -> U transition
ladanyi [Sun, 29 Jan 2006 22:10:06 +0000] rev 1921
test for simann
ladanyi [Sun, 29 Jan 2006 22:07:52 +0000] rev 1920
added simann_maxcut_demo
ladanyi [Sun, 29 Jan 2006 22:06:45 +0000] rev 1919
demo for simann
ladanyi [Sun, 29 Jan 2006 22:06:10 +0000] rev 1918
more doc
ladanyi [Sun, 29 Jan 2006 22:04:48 +0000] rev 1917
include the gui in the deb
deba [Fri, 27 Jan 2006 14:32:33 +0000] rev 1916
make public the shiftedStart inorder to compute just n dijkstra
deba [Fri, 27 Jan 2006 14:18:11 +0000] rev 1915
Add new ItemSetTraits for ANode and BNode
deba [Fri, 27 Jan 2006 08:19:42 +0000] rev 1914
Doc bug fix
deba [Fri, 27 Jan 2006 08:18:47 +0000] rev 1913
Making iterable bool map dynamic
Changed interface
deba [Fri, 27 Jan 2006 08:17:25 +0000] rev 1912
Algorithms by szakall
deba [Thu, 26 Jan 2006 17:18:12 +0000] rev 1911
The pre BpUGraph concept
deba [Thu, 26 Jan 2006 16:24:40 +0000] rev 1910
Bipartite => Bp
Upper => A
Lower => B
+ some bug fix
klao [Thu, 26 Jan 2006 15:42:13 +0000] rev 1909
Undir -> U transition
alpar [Thu, 26 Jan 2006 06:44:22 +0000] rev 1908
Better doc.
alpar [Thu, 26 Jan 2006 06:43:59 +0000] rev 1907
MALE and FEMALE node shape added.
deba [Wed, 25 Jan 2006 16:44:19 +0000] rev 1906
Omitting warnings
ladanyi [Wed, 25 Jan 2006 15:03:45 +0000] rev 1905
Do not append -Wall -W to CXXFLAGS when it is set on the commandline.
deba [Wed, 25 Jan 2006 14:58:04 +0000] rev 1904
Bug fix for empty intervall sorting
deba [Wed, 25 Jan 2006 14:40:26 +0000] rev 1903
Bug fix
deba [Wed, 25 Jan 2006 12:10:18 +0000] rev 1902
state setting function for heaps
If we know that which elements were in the heap then
we can clear it in better time complexity.
deba [Tue, 24 Jan 2006 16:07:38 +0000] rev 1901
Lemon Graph Format uses label instead of id named map.
alpar [Thu, 19 Jan 2006 16:56:39 +0000] rev 1900
Fix bug #18: bug in LpSolverBase::Col operator!= and ::Row operator!=
alpar [Wed, 18 Jan 2006 09:42:59 +0000] rev 1899
- setCol() -> col()
- better doc.
alpar [Wed, 18 Jan 2006 09:42:08 +0000] rev 1898
- tolerance() added.
- better doc.
alpar [Wed, 18 Jan 2006 09:40:53 +0000] rev 1897
Tolerance<long double> added
hegyi [Sat, 14 Jan 2006 13:42:37 +0000] rev 1896
Documentation of classes realizing algorithm running.
alpar [Sat, 14 Jan 2006 08:44:59 +0000] rev 1895
- colName() added (untested on CPLEX)
- possibility to set lower/upper bounds of several cols at once
- setObj() -> obj()
- setRow() -> row()
alpar [Sat, 14 Jan 2006 08:17:00 +0000] rev 1894
Changes in doc
hegyi [Thu, 12 Jan 2006 15:24:24 +0000] rev 1893
Documenatation of MapWin.
hegyi [Thu, 12 Jan 2006 14:36:08 +0000] rev 1892
Documentation of MapSelector. If no default value is present in MapSelector, Reset button does not appear.
hegyi [Thu, 12 Jan 2006 13:28:54 +0000] rev 1891
Documentation of NoteBookTab. Redundant function parameters are removed from other classes as well.
hegyi [Wed, 11 Jan 2006 15:49:06 +0000] rev 1890
Documentation of NewMapWin.
hegyi [Wed, 11 Jan 2006 15:06:17 +0000] rev 1889
Documentation of MainWin.
hegyi [Tue, 10 Jan 2006 15:15:57 +0000] rev 1888
If default value of a new map is constant, the newly created elements will get that value as well. Documentation is added to BrokenEdge, MapStorage and GraphDisplazCanvas classes.
hegyi [Mon, 09 Jan 2006 12:41:06 +0000] rev 1887
The tree that is created for evaluation of expression string at new map creation is deleted after usage.
hegyi [Mon, 09 Jan 2006 11:55:47 +0000] rev 1886
Creation of algorithm dialog is even simpler by the usage of the newly created addMapSelector function.
hegyi [Fri, 06 Jan 2006 23:16:51 +0000] rev 1885
Forgotten file committed.
hegyi [Fri, 06 Jan 2006 16:07:08 +0000] rev 1884
In algorithm window maps can be selected and reated through MapSelector widget.
ladanyi [Fri, 06 Jan 2006 14:44:04 +0000] rev 1883
Set arrow coordinates when creating a new edge.
hegyi [Fri, 06 Jan 2006 14:36:46 +0000] rev 1882
MapSelector has become a standalone class.
hegyi [Fri, 06 Jan 2006 13:58:49 +0000] rev 1881
Result of KruskalGUIAlgo is refreshed if displayed, but no more setin a forced way.
alpar [Fri, 06 Jan 2006 10:42:58 +0000] rev 1880
Reformatting: too long code lines.
hegyi [Thu, 05 Jan 2006 16:54:34 +0000] rev 1879
Kruskal algorithm can be run from GUI from now on.
hegyi [Thu, 05 Jan 2006 12:30:09 +0000] rev 1878
Several changes. \n If new map is added to mapstorage it emits signal with the name of the new map. This was important, because from now on not only tha mapwin should be updated. \n Furthermore algobox gets a pointer to mapstorage instead of only the mapnames from it. This is important because without it it would be complicated to pass all of the required maps to algobox.
ladanyi [Thu, 05 Jan 2006 01:54:24 +0000] rev 1877
Set the move tool active by default.
hegyi [Wed, 04 Jan 2006 18:05:55 +0000] rev 1876
Communication with algorithm window is developed.
alpar [Wed, 04 Jan 2006 13:31:59 +0000] rev 1875
Happy new year to LEMON
alpar [Wed, 04 Jan 2006 13:20:17 +0000] rev 1874
Doc updates
alpar [Wed, 04 Jan 2006 13:19:12 +0000] rev 1873
IterableBool{Upper/Lower}NodeMaps
hegyi [Wed, 04 Jan 2006 11:41:58 +0000] rev 1872
Best feature ever\! Name of tabs are different from now on\!
hegyi [Tue, 03 Jan 2006 17:30:22 +0000] rev 1871
Coding of Algorithms has begun, but code is really-really ugly yet.
deba [Tue, 03 Jan 2006 16:05:27 +0000] rev 1870
Delete misnamed file
hegyi [Tue, 03 Jan 2006 14:56:45 +0000] rev 1869
Handling of tabs is rationalized a bit. More than one file can be given at startup in command prompt. If there is no file given in command prompt, an empty tab will be present at startup.
deba [Wed, 21 Dec 2005 08:47:38 +0000] rev 1868
Bug fix in bipartite graph
ladanyi [Mon, 19 Dec 2005 16:59:05 +0000] rev 1867
Fix crash when the input file does not contain any nodeset or edgeset.
deba [Mon, 19 Dec 2005 14:58:09 +0000] rev 1866
New file and data structures: sub_graph
Moved to new group with the edge_sets
deba [Mon, 19 Dec 2005 09:47:10 +0000] rev 1865
Doc fix
deba [Mon, 19 Dec 2005 09:43:13 +0000] rev 1864
Fixing Bellman's name
ladanyi [Sun, 18 Dec 2005 03:01:53 +0000] rev 1863
Demos and benchmarks are not built by default now. They can be enabled with the --enable-demo and --enable-benchmark configure flags.
ladanyi [Sun, 18 Dec 2005 01:51:03 +0000] rev 1862
Added guipixbufs.h to BUILT_SOURCES. This solves 'make dist' problems.
ladanyi [Sat, 17 Dec 2005 21:51:10 +0000] rev 1861
Distribute xml.h too.
ladanyi [Sat, 17 Dec 2005 20:55:41 +0000] rev 1860
Save and load the coordinates of the arrows on the edges.
deba [Wed, 14 Dec 2005 18:11:03 +0000] rev 1859
Bug fix
and doc fix
deba [Wed, 14 Dec 2005 18:07:28 +0000] rev 1858
Bug fix in def pred map
klao [Sat, 10 Dec 2005 19:38:53 +0000] rev 1857
belmann_ford:
* run() with length limit
* bugfix in processNextRound()
hegyi [Thu, 08 Dec 2005 14:16:08 +0000] rev 1856
Notebook tabs can be closed.
alpar [Wed, 07 Dec 2005 15:43:44 +0000] rev 1855
Eliminate warnins
alpar [Wed, 07 Dec 2005 15:40:27 +0000] rev 1854
Bugfix
alpar [Wed, 07 Dec 2005 15:39:48 +0000] rev 1853
Fix template version of Invalid.
deba [Wed, 07 Dec 2005 11:57:30 +0000] rev 1852
Some bug fixes and improvments in the io classes
alpar [Tue, 06 Dec 2005 18:44:26 +0000] rev 1851
Doc improvements
marci [Tue, 06 Dec 2005 11:59:44 +0000] rev 1850
Bugfix
hegyi [Tue, 06 Dec 2005 10:53:38 +0000] rev 1849
Notebook style is provided. Without opportunity to close tabs. :-) But with all other necessary things (I think).
deba [Mon, 05 Dec 2005 17:03:58 +0000] rev 1848
Doc bug fix
alpar [Mon, 05 Dec 2005 17:03:31 +0000] rev 1847
- Changed and improved Timer interface
- several new member functions
- reset() -> restart() renaming
- TimeReport: a Timer that prints a report on destruction.
- counter.h: a tool to measure the number of streps of algorithms.
- New documentation module for time measuring and counting.
deba [Sat, 03 Dec 2005 18:30:31 +0000] rev 1846
I have forgot the attributes
deba [Sat, 03 Dec 2005 18:17:29 +0000] rev 1845
Implementation redesign
Throws exception
deba [Sat, 03 Dec 2005 18:15:43 +0000] rev 1844
Changed implementation and bug fix
alpar [Fri, 02 Dec 2005 10:02:40 +0000] rev 1843
bugfix
deba [Thu, 01 Dec 2005 15:08:46 +0000] rev 1842
NewEdgeSetAdaptor -> ListEdgeSet
and moved to edge_set.h
marci [Wed, 30 Nov 2005 17:49:01 +0000] rev 1841
bug fix
marci [Wed, 30 Nov 2005 17:00:17 +0000] rev 1840
max flow with lp column generation
deba [Wed, 30 Nov 2005 13:24:37 +0000] rev 1839
Some bug fix
hegyi [Wed, 30 Nov 2005 13:24:23 +0000] rev 1838
MapWin is created and disposed from now instead of being show and hide.
hegyi [Tue, 29 Nov 2005 19:31:58 +0000] rev 1837
Structure of GUI is now more clear-cut than before.
alpar [Tue, 29 Nov 2005 08:43:50 +0000] rev 1836
Clarify INVALID implementation.
alpar [Tue, 29 Nov 2005 08:40:03 +0000] rev 1835
- tolerance.h added
- tolerance handler added to preflow (but not yet used!!).
deba [Mon, 28 Nov 2005 11:14:59 +0000] rev 1834
Doc fix
deba [Mon, 28 Nov 2005 11:14:01 +0000] rev 1833
Radix sort algorithm
deba [Thu, 24 Nov 2005 15:48:53 +0000] rev 1832
Bug fix
hegyi [Wed, 23 Nov 2005 16:24:59 +0000] rev 1831
No segmentation fault caused by zero long edges.
deba [Wed, 23 Nov 2005 16:08:02 +0000] rev 1830
Document improvments
deba [Wed, 23 Nov 2005 15:42:36 +0000] rev 1829
Correcting alteration notifing
deba [Wed, 23 Nov 2005 11:20:14 +0000] rev 1828
Static maps for bipartite graphs.
deba [Tue, 22 Nov 2005 15:15:31 +0000] rev 1827
Fixing bug in g++-3.3
ladanyi [Tue, 22 Nov 2005 14:35:33 +0000] rev 1826
clean-up
ladanyi [Tue, 22 Nov 2005 10:27:25 +0000] rev 1825
fixed some memory leaks
deba [Mon, 21 Nov 2005 18:12:11 +0000] rev 1824
Erasing old header
Correcting makefile
hegyi [Mon, 21 Nov 2005 18:03:20 +0000] rev 1823
NewMapWin has become Dialog instead of Window. Therefore it is created dynamically, when there is need for it, instead of keeping one instance in memory. This solution is slower, but more correct than before.
deba [Mon, 21 Nov 2005 17:59:27 +0000] rev 1822
Erasing from the Makefile.am too
deba [Mon, 21 Nov 2005 17:58:24 +0000] rev 1821
Erasing old tests
deba [Mon, 21 Nov 2005 17:48:00 +0000] rev 1820
Undir Bipartite Graph/Full and Smart/ without concept, doc and concept
checking
hegyi [Mon, 21 Nov 2005 12:07:05 +0000] rev 1819
Reorganizing.
alpar [Mon, 21 Nov 2005 09:08:16 +0000] rev 1818
UndirEulerIt added
alpar [Fri, 18 Nov 2005 11:17:08 +0000] rev 1817
- Spellcheck (pathes->paths)
alpar [Fri, 18 Nov 2005 11:13:11 +0000] rev 1816
- Spellcheck (pathes->paths)
- todos
alpar [Fri, 18 Nov 2005 11:10:53 +0000] rev 1815
Bugfix
hegyi [Thu, 17 Nov 2005 15:34:18 +0000] rev 1814
As initial value of a new map expression with ()+-/* operators can be given. These operators work on numbers, or on maps. If maps are given, then the new value for a given graph element will be calculated using the value from the given maps that belong to that graph element.
deba [Thu, 17 Nov 2005 10:46:38 +0000] rev 1813
Bug fix
alpar [Thu, 17 Nov 2005 10:16:29 +0000] rev 1812
split(Edge) member function added.
alpar [Thu, 17 Nov 2005 10:14:55 +0000] rev 1811
Several bugfices.
deba [Wed, 16 Nov 2005 18:58:10 +0000] rev 1810
Modified iterators on graph maps
Other iterators for not graph maps
marci [Wed, 16 Nov 2005 14:46:22 +0000] rev 1809
The GRAPH_TYPEDEFS macro is a bug.
alpar [Wed, 16 Nov 2005 13:39:29 +0000] rev 1808
wirteable -> writable
alpar [Wed, 16 Nov 2005 13:26:04 +0000] rev 1807
Empty graph is (strongly) connected.
alpar [Wed, 16 Nov 2005 13:21:57 +0000] rev 1806
The first parameter of runningTimeTest became const.
It is necessary to enable to pass of temporary objects.
alpar [Wed, 16 Nov 2005 13:19:05 +0000] rev 1805
Iterable Bool maps can count the number of true and false values.
alpar [Wed, 16 Nov 2005 13:17:02 +0000] rev 1804
(UNDIR)GRAPH_TYPEDEFS also defines some basic graph maps
alpar [Wed, 16 Nov 2005 13:15:33 +0000] rev 1803
Better doc.
deba [Wed, 16 Nov 2005 09:15:41 +0000] rev 1802
Demo for topology
deba [Wed, 16 Nov 2005 09:11:44 +0000] rev 1801
Images for doc
deba [Wed, 16 Nov 2005 09:10:24 +0000] rev 1800
bipartite by szakall
deba [Wed, 16 Nov 2005 09:08:36 +0000] rev 1799
Warning because unused parameters
klao [Wed, 16 Nov 2005 05:01:04 +0000] rev 1798
lp_cplex: getDual compiles; untested
klao [Wed, 16 Nov 2005 04:22:49 +0000] rev 1797
lp_test.cc:
* bugfix in cplex part: check compiling and running on two different instances
klao [Tue, 15 Nov 2005 20:51:06 +0000] rev 1796
lp_skeleton: _getDual "implemented"
klao [Tue, 15 Nov 2005 20:50:21 +0000] rev 1795
bugfix in undir_graph_extender -> graph_extender transition
deba [Mon, 14 Nov 2005 18:55:19 +0000] rev 1794
String->Double
deba [Mon, 14 Nov 2005 18:40:15 +0000] rev 1793
Documentation fixes
deba [Mon, 14 Nov 2005 18:39:17 +0000] rev 1792
Arrangement of the documentation changed
deba [Mon, 14 Nov 2005 18:38:41 +0000] rev 1791
Modification on the base graph concept
The extended interface does not changed
deba [Mon, 14 Nov 2005 18:36:45 +0000] rev 1790
Bug fix
deba [Mon, 14 Nov 2005 18:35:20 +0000] rev 1789
eps images
deba [Mon, 14 Nov 2005 18:34:16 +0000] rev 1788
Some documentation modifications
marci [Sun, 13 Nov 2005 20:01:17 +0000] rev 1787
bugfix in setCol, getting dual values
deba [Thu, 10 Nov 2005 12:41:33 +0000] rev 1786
Doc bug fix
deba [Thu, 10 Nov 2005 12:40:58 +0000] rev 1785
Assertion with own exception throwing
deba [Thu, 10 Nov 2005 12:40:26 +0000] rev 1784
Bug fix
deba [Wed, 09 Nov 2005 13:04:39 +0000] rev 1783
One more bug fix
deba [Wed, 09 Nov 2005 12:54:59 +0000] rev 1782
Bug fix.
deba [Wed, 09 Nov 2005 12:07:00 +0000] rev 1781
Path length limit for belmann_ford.h
alpar [Tue, 08 Nov 2005 10:12:45 +0000] rev 1780
- Timer can be stop()ed and (re)start()ed.
- Obsolete \bug removed
alpar [Tue, 08 Nov 2005 10:10:09 +0000] rev 1779
Obsolete bug removed
deba [Fri, 04 Nov 2005 19:19:52 +0000] rev 1778
Some just writeable bool maps.
ladanyi [Fri, 04 Nov 2005 19:07:15 +0000] rev 1777
improved zooming
deba [Fri, 04 Nov 2005 17:44:13 +0000] rev 1776
Images for grid_graph_demo
deba [Fri, 04 Nov 2005 17:33:33 +0000] rev 1775
Added doc to demos.
deba [Fri, 04 Nov 2005 16:40:54 +0000] rev 1774
UnsupportedException on erase with Snapshot
alpar [Fri, 04 Nov 2005 16:35:18 +0000] rev 1773
Bugfix
alpar [Fri, 04 Nov 2005 16:35:06 +0000] rev 1772
SnapShot -> Snapshot
alpar [Fri, 04 Nov 2005 16:21:41 +0000] rev 1771
(Dual)Expr::simplify(double tolerance) added
alpar [Fri, 04 Nov 2005 16:18:51 +0000] rev 1770
SnapShot -> Snapshot
deba [Fri, 04 Nov 2005 16:10:23 +0000] rev 1769
Removed todo
Moved to topology module
deba [Fri, 04 Nov 2005 15:59:21 +0000] rev 1768
Removing findEdge
deba [Fri, 04 Nov 2005 15:52:24 +0000] rev 1767
Changed name
alpar [Fri, 04 Nov 2005 15:48:06 +0000] rev 1766
Tons of todos have been removed.
deba [Fri, 04 Nov 2005 15:00:19 +0000] rev 1765
Removing todos
deba [Fri, 04 Nov 2005 14:49:14 +0000] rev 1764
Images for topology
deba [Fri, 04 Nov 2005 14:48:10 +0000] rev 1763
pred => predEdge rename
jacint [Fri, 04 Nov 2005 13:53:22 +0000] rev 1762
throwing an exception if s=t
deba [Fri, 04 Nov 2005 13:20:24 +0000] rev 1761
Hiding :) todos
klao [Fri, 04 Nov 2005 12:01:40 +0000] rev 1760
concept/graph.h: graphs defined by using components (_*Graph) need no
documentation
deba [Fri, 04 Nov 2005 10:55:13 +0000] rev 1759
Increment and decrement operator for IterableIntMap::Reference
deba [Fri, 04 Nov 2005 10:51:35 +0000] rev 1758
Doc fix
alpar [Wed, 02 Nov 2005 16:43:18 +0000] rev 1757
Spellcheck
alpar [Wed, 02 Nov 2005 16:32:29 +0000] rev 1756
GRAPH_TYPEDEFS and UNDIRGRAPH_TYPEDEFS macros added to graph_utils.h.
deba [Wed, 02 Nov 2005 15:28:37 +0000] rev 1755
Make constructor explicit
Indentation changed
deba [Wed, 02 Nov 2005 15:27:38 +0000] rev 1754
Documentation modified
deba [Wed, 02 Nov 2005 15:26:04 +0000] rev 1753
Some change on the clear
deba [Wed, 02 Nov 2005 15:25:13 +0000] rev 1752
IterableIntMap
todo: documentation need
deba [Wed, 02 Nov 2005 15:24:38 +0000] rev 1751
Swap col and row map
deba [Wed, 02 Nov 2005 15:23:46 +0000] rev 1750
Connected components, etc...
Based on the dfs visitor interface
deba [Wed, 02 Nov 2005 15:22:28 +0000] rev 1749
Visitor interface for the dfs algorithm.
klao [Wed, 02 Nov 2005 12:44:50 +0000] rev 1748
small svn:ignore fixups
deba [Fri, 28 Oct 2005 09:01:59 +0000] rev 1747
Faster implementation
deba [Fri, 28 Oct 2005 08:40:42 +0000] rev 1746
If the file does not exist LemonReader throws exception
deba [Wed, 26 Oct 2005 11:10:18 +0000] rev 1745
Upgrading tests
deba [Wed, 26 Oct 2005 11:09:29 +0000] rev 1744
Removing old input/output functions
deba [Wed, 26 Oct 2005 10:59:51 +0000] rev 1743
Filename can be given as std::string
deba [Wed, 26 Oct 2005 10:52:09 +0000] rev 1742
Show description of the file
deba [Wed, 26 Oct 2005 10:50:47 +0000] rev 1741
Some modifications on shortest path algoritms:
- heap traits
- checked execution
deba [Mon, 24 Oct 2005 17:03:02 +0000] rev 1740
Bug fix in connectedComponents
Strongly connected components
alpar [Mon, 24 Oct 2005 15:59:38 +0000] rev 1739
Computing the number of the connected components and the components themselves.
alpar [Mon, 24 Oct 2005 15:58:38 +0000] rev 1738
Euler tour iterator.
hegyi [Mon, 24 Oct 2005 10:15:40 +0000] rev 1737
Newly created map is realized by the property givening by common sense.
alpar [Mon, 24 Oct 2005 08:12:26 +0000] rev 1736
Doxyfile for documenting glemon's architecture.
alpar [Mon, 24 Oct 2005 08:11:21 +0000] rev 1735
New version of XML reader/writer.
Now, there are only a single XmlIo class both for reading and writing.
alpar [Mon, 24 Oct 2005 08:09:59 +0000] rev 1734
- dijkstraZero() added. (Until we conclude how to handle the related problem.)
- processed() query function added.
hegyi [Fri, 21 Oct 2005 13:32:12 +0000] rev 1733
MapSelector widget is able to pop up NewMap window. At the moment I hope MapSelector widget is done.
deba [Fri, 21 Oct 2005 08:34:47 +0000] rev 1732
Bugfix
hegyi [Thu, 20 Oct 2005 15:50:23 +0000] rev 1731
Mapselector widget reached its first release, but there are still work to do on it, I know...
deba [Mon, 17 Oct 2005 10:30:59 +0000] rev 1730
Minor changes and bugfixes
deba [Mon, 17 Oct 2005 10:28:48 +0000] rev 1729
Removing signal/commit Change from alteration notifier
It makes slower the change Target/Source functions
and used only by the In/Out DegMap
deba [Fri, 14 Oct 2005 11:03:40 +0000] rev 1728
Updating tests
deba [Fri, 14 Oct 2005 11:02:34 +0000] rev 1727
Doc and changing heap
deba [Fri, 14 Oct 2005 11:01:21 +0000] rev 1726
Doc bugfix
deba [Fri, 14 Oct 2005 11:00:40 +0000] rev 1725
Using proper return type
deba [Fri, 14 Oct 2005 10:58:54 +0000] rev 1724
Heap not for the dijkstra
It will be used in the minCut algorithm
deba [Fri, 14 Oct 2005 10:53:51 +0000] rev 1723
Really short description of these shortest path algorithms
ladanyi [Fri, 14 Oct 2005 10:53:35 +0000] rev 1722
bugfix (affected x86_64 only)
deba [Fri, 14 Oct 2005 10:52:15 +0000] rev 1721
Named parameter for heap and cross ref
It needs some redesign
deba [Fri, 14 Oct 2005 10:49:51 +0000] rev 1720
Matrixmaps moved to own file
deba [Fri, 14 Oct 2005 10:48:34 +0000] rev 1719
Traits moved to own file
Tag for reference maps
Possibility to handle proper the return type
of the operator[]() const -- value or reference
deba [Fri, 14 Oct 2005 10:44:49 +0000] rev 1718
Extending observer interface
It will be used in the indegmap, outdegmap types
deba [Fri, 14 Oct 2005 10:40:00 +0000] rev 1717
Added clear function to heaps and concept
alpar [Fri, 07 Oct 2005 11:05:35 +0000] rev 1716
Sym -> Undir
alpar [Fri, 07 Oct 2005 11:05:08 +0000] rev 1715
Doc improvments
hegyi [Thu, 06 Oct 2005 12:32:06 +0000] rev 1714
Shape keeping movement is implemented, at last. Many thanks to Alpar.
alpar [Thu, 06 Oct 2005 10:28:45 +0000] rev 1713
Doc improvments
deba [Thu, 06 Oct 2005 09:58:21 +0000] rev 1712
Little modifications
deba [Thu, 06 Oct 2005 09:57:23 +0000] rev 1711
All pairs shortest path test
deba [Thu, 06 Oct 2005 09:37:53 +0000] rev 1710
Bug solved in named parameters
Simplify my Johnson algorithm
deba [Wed, 05 Oct 2005 16:45:37 +0000] rev 1709
Template Named Parameter bugfix
ladanyi [Wed, 05 Oct 2005 13:44:29 +0000] rev 1708
compile with old gtkmm
deba [Wed, 05 Oct 2005 13:21:41 +0000] rev 1707
Changing makefile
deba [Wed, 05 Oct 2005 13:19:30 +0000] rev 1706
Removing NeedCopy
deba [Wed, 05 Oct 2005 13:18:51 +0000] rev 1705
Removing smart references
deba [Wed, 05 Oct 2005 13:17:42 +0000] rev 1704
findUndirEdge, ConUndirEdgeIt
some modification in the undir graph extenders
deba [Wed, 05 Oct 2005 13:15:47 +0000] rev 1703
Proper sized map type
deba [Mon, 03 Oct 2005 14:22:10 +0000] rev 1702
Bugfix in list_graph
deba [Mon, 03 Oct 2005 13:51:25 +0000] rev 1701
Bugfix
deba [Mon, 03 Oct 2005 10:21:27 +0000] rev 1700
Extend Makefile
deba [Mon, 03 Oct 2005 10:20:56 +0000] rev 1699
Some shortest path algorithms
All-pair-shortest path algorithms without function interface
we may need it
deba [Mon, 03 Oct 2005 10:18:38 +0000] rev 1698
Small functions for discovering graph topology
deba [Mon, 03 Oct 2005 10:17:53 +0000] rev 1697
Preliminary SplitGraphAdaptor
And some other improvments
deba [Mon, 03 Oct 2005 10:16:45 +0000] rev 1696
CompileTimeAnd
Used by SplitGraphAdaptor
deba [Mon, 03 Oct 2005 10:14:49 +0000] rev 1695
Potential difference map
NodeMatrixMap -- Matrix over the nodes
Indicators for common tags
deba [Mon, 03 Oct 2005 10:11:29 +0000] rev 1694
Fixing naming conventions
Temporarly bugfix with named-parameters
Removing dead codes
deba [Fri, 30 Sep 2005 13:15:28 +0000] rev 1693
Improving GridGraph and HyperCubeGraph
deba [Fri, 30 Sep 2005 13:13:42 +0000] rev 1692
Correcting the names in the \files documentation.
deba [Fri, 30 Sep 2005 13:12:39 +0000] rev 1691
Handling C x A -> A multiplication
deba [Fri, 30 Sep 2005 13:10:42 +0000] rev 1690
Bug fix.
alpar [Wed, 28 Sep 2005 08:14:39 +0000] rev 1689
- runningTimeTest(): a tool to measure running times more precisely.
- TimeStamp now uses double to count cpu-times
- 'get's removed from the query functions of Times and TimeStamp
klao [Fri, 16 Sep 2005 09:57:02 +0000] rev 1688
Permissions and svn:ignore cleanup.
alpar [Fri, 16 Sep 2005 09:18:28 +0000] rev 1687
- silly mistake fixed
- output is graph_orientation.eps
- sample input file added
deba [Fri, 16 Sep 2005 09:01:20 +0000] rev 1686
Using std:: prefix for the functions in the c* headers
deba [Fri, 16 Sep 2005 09:00:18 +0000] rev 1685
Some bugfixes
alpar [Wed, 14 Sep 2005 10:00:43 +0000] rev 1684
Better doc.