Timeline
03/30/10:
- 22:05 Ticket #364 (Missing UndirectedTag in SubGraph adaptor) created by
- By using the SubGraph? adaptor from a ListGraph? with the kruskal …
03/19/10:
- 19:30 Ticket #363 (Implementing a planar graph type) created by
- My goal is to implement classes for planar graphs. The PlanarGraph …
- 17:07 Ticket #362 (Radix sort for bidirectional iterators) created by
- The current implementation of radixSort allows only random access …
- 09:18 WikiStart edited by
- (diff)
- 09:18 News edited by
- (diff)
- 08:26 LemonRepos edited by
- (diff)
- 08:25 Downloads edited by
- (diff)
- 08:25 WikiStart edited by
- (diff)
- 08:24 News edited by
- (diff)
- 08:24 News edited by
- (diff)
- 08:24 WikiStart edited by
- (diff)
- 08:19 Documentation edited by
- (diff)
03/18/10:
- 23:00 Milestone LEMON 1.2 release completed
- The goals of this release are - to port most of the remaining useful …
- 14:39 Ticket #341 (Update the NEWS file) closed by
- done
- 13:33 Ticket #339 (Unify sources before release) closed by
- done: Replying to kpeter: > This task seems to be done except …
- 13:27 Ticket #359 (Trim the documentation) closed by
- done: Replying to kpeter: > I attached two patches: > > - …
- 13:24 Ticket #360 (VS compilation error) closed by
- fixed: Replying to kpeter: > The attached patch [34380851fc86] …
- 00:31 Ticket #361 (Tolerance support in BellmanFord) created by
- BellmanFord (and maybe Dijkstra as well) could construct and store an …
03/17/10:
- 17:11 Ticket #360 (VS compilation error) created by
- bellman_ford_test.cc fails to compile with Visual Studio 2005 and …
- 13:25 LemonRepos edited by
- (diff)
- 12:32 Ticket #356 (MaxWeightedPerfectMatching re-run crash) closed by
- fixed
- 09:53 Ticket #359 (Trim the documentation) created by
- As usual, we have to trim the documentation before releasing version 1.2.
- 09:51 Ticket #314 (Fractional matching and jumpstart initialization for general matchings) closed by
- done: Replying to alpar: > Replying to deba: > > The …
03/15/10:
- 22:39 Ticket #358 (Runtime complexity for every algorithm) created by
-
Some algorithms such as
MaxWeightedPerfectMatchinginclude the … - 22:36 Ticket #357 (Guidelines for run/init/start) created by
- Please add a few guidelines to the documentation about what are the …
- 22:23 Ticket #356 (MaxWeightedPerfectMatching re-run crash) created by
- Hello, when calling run a second time after changing the referenced …
03/14/10:
- 09:11 GSoC2010Ideas edited by
- (diff)
- 08:15 Ticket #348 (Better figure for illustrating matching algs.) closed by
- done: Replying to kpeter: > I like both images, but Alpar's …
- 07:38 Ticket #179 (Port the min mean cycle algorithms) closed by
- done: Replying to kpeter: > I think, we can close this ticket …
- 06:54 GSoC2010Ideas edited by
- (diff)
- 06:10 GSoC2010Ideas edited by
- A new topic + improve former ones (diff)
03/13/10:
03/12/10:
- 22:12 GSoC2010Ideas edited by
- (diff)
- 22:09 GSoC2010Ideas edited by
- (diff)
- 21:58 Ticket #306 (Tolerance in min cut algorithms) closed by
- fixed: I think, we can close this ticket. See #352 for the follow-up.
- 16:36 GSoC2010Ideas edited by
- (diff)
- 09:39 Ticket #355 (SCIP MipSolver backend) created by
- The title says everything. Please find Ambros Gleixner's beta version …
03/10/10:
03/08/10:
- 14:46 Ticket #354 (min_cost_flow_test.cc fails to compile with gcc-3.3) closed by
- fixed: Replying to kpeter: > The attached patch [a93f1a27d831] …
- 11:29 News edited by
- (diff)
- 11:28 WikiStart edited by
- (diff)
- 11:21 Downloads edited by
- (diff)
- 11:20 Documentation edited by
- (diff)
03/07/10:
- 10:06 Ticket #354 (min_cost_flow_test.cc fails to compile with gcc-3.3) created by
- Please find the compiler output below. […]
03/06/10:
03/05/10:
- 17:16 GSoC2010ApplicationTemplate edited by
- (diff)
- 17:16 GSoC2010ApplicationTemplate edited by
- (diff)
- 16:27 GSoC2010ApplicationTemplate created by
- 16:20 GSoC2010 edited by
- (diff)
- 16:19 GSoC2010 edited by
- (diff)
- 16:15 GSoC2010 edited by
- (diff)
- 16:14 GSoC2010Ideas created by
- 16:11 GSoC2010 edited by
- (diff)
- 14:58 GSoC2010 edited by
- (diff)
03/04/10:
- 08:10 Ticket #323 (Fixes and improvements for Suurballe) closed by
- fixed
- 07:49 Ticket #353 (Clarify typenames in NetworkSimplex) created by
- In [f3bc4e9b5f3a], the following typedefs […] was replaced with …
- 07:20 Ticket #181 (Support multiple targets for Suurballe) closed by
- done: [9a7e4e606f83] went to the main branch, this ticket can be closed.
03/03/10:
- 17:32 Ticket #301 (Port fourary, d-ary, pairing and binomial heaps) closed by
- done: Replying to kpeter: > Okay. Then what about applying …
03/02/10:
- 11:19 GSoC2010 edited by
- (diff)
- 11:15 GSoC2010 edited by
- (diff)
- 11:03 GSoC2010 edited by
- (diff)
- 10:50 GSoC2010 edited by
- (diff)
- 10:47 GSoC2010 edited by
- (diff)
- 10:46 GSoC2010 edited by
- (diff)
- 10:45 GSoC2010 edited by
- (diff)
- 10:44 GSoC2010 edited by
- (diff)
- 09:07 Ticket #352 (Tolerance in GomoryHu) created by
-
For
GomoryHuclass,Tolerancetype/object cannot be set, but it …
03/01/10:
02/28/10:
- 23:07 Ticket #351 (Port the LP utilities) created by
-
Revise and port the Lp utilities from SVN, namely
-
lp_utils.h… - 20:12 Ticket #342 (Improve readme, install files and the doc mainpage) closed by
- done: Replying to kpeter: > I attached another patch …
- 20:03 Ticket #51 (Port the remaining shortest path algorithms) closed by
- done: Replying to kpeter: > I propose another solution: an …
- 19:23 GSoC2010 edited by
- (diff)
- 19:18 Ticket #347 (Computing the total flow cost in DIMACS solver) closed by
- done: Replying to kpeter: > See the patch [9d380bf27194] …
- 18:31 GSoC2010 edited by
- (diff)
- 18:27 Ticket #332 (Valgrind reports memory leak in arg_parser_demo) closed by
- fixed: Replying to alpar: > [c2ff0a365245] is an implementation …
- 06:07 Ticket #350 (min_cost_flow_test does not build with VS2008) closed by
- fixed: Replying to kpeter: > Could you please check whether this …
Note: See TracTimeline
for information about the timeline view.
