LEMON: {3} Active Tickets by Milestone
http://lemon.cs.elte.hu/trac/lemon/report/3
Trac Report - en-usLEMONhttp://lemon.cs.elte.hu/trac/lemon/chrome/site/lemon-logo.gif
http://lemon.cs.elte.hu/trac/lemon/report/3
Trac v1.2.3#376: A star (A*) algorithmFri, 09 Dec 2011 16:17:01 GMTFri, 02 Jul 2010 17:28:11 GMT<p>
It would be nice to have an A-star (A*) algorithm implementation in LEMON. Additionally, a bidirectional version could also be implemented (see also: <a class="assigned ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/249" title="#249: enhancement: Bidirectional Bfs and Dijkstra (assigned)">#249</a>).
</p>
<p>
<a class="ext-link" href="http://en.wikipedia.org/wiki/A*_search_algorithm"><span class="icon"></span>http://en.wikipedia.org/wiki/A*_search_algorithm</a>
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/376
http://lemon.cs.elte.hu/trac/lemon/ticket/376Report#384: Adaptor class for complementary graphFri, 15 Jul 2016 11:50:18 GMTSat, 31 Jul 2010 21:12:35 GMT<p>
It would be nice to have an adaptor class to obtain the complementary graph of a simple, undirected graph.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/384
http://lemon.cs.elte.hu/trac/lemon/ticket/384Report#394: Add supprt for lp_solveFri, 15 Jul 2016 11:52:55 GMTThu, 07 Oct 2010 05:21:21 GMT<p>
<a class="ext-link" href="http://lpsolve.sourceforge.net/5.5/"><span class="icon"></span>http://lpsolve.sourceforge.net/5.5/</a>
</p>
<p>
<a class="ext-link" href="http://sourceforge.net/projects/lpsolve/"><span class="icon"></span>http://sourceforge.net/projects/lpsolve/</a>
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/394
http://lemon.cs.elte.hu/trac/lemon/ticket/394Report#189: Add the functionality of ItemSetTraits to the graphsWed, 04 Nov 2009 18:28:10 GMTSun, 30 Nov 2008 21:25:17 GMT<p>
Maybe we could introduce the functionality of <code>ItemSetTraits</code> to the graph concepts and to the adaptors in order to have the followings for all graph types.
</p>
<ul><li><code>Graph::Map<T, Value></code>
</li><li><code>Graph::It<T></code> or <code>Graph::ItemIt<T></code>
</li></ul><p>
Where <code>T</code> can be <code>Node</code>, <code>Arc</code> or <code>Edge</code>.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/189
http://lemon.cs.elte.hu/trac/lemon/ticket/189Report#78: Added functionality to graphToEps().Fri, 21 Nov 2008 15:00:35 GMTThu, 03 Apr 2008 15:36:35 GMT<p>
It would be nice to enable multiline copyright notices in <code>GraphToEps::copyright()</code>
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/78
http://lemon.cs.elte.hu/trac/lemon/ticket/78Report#77: Added functionality to nodePsTexts() named param. of graphToEps().Fri, 21 Nov 2008 15:00:25 GMTThu, 03 Apr 2008 15:33:20 GMT<p>
When a pure postscript block is inserted as each node with nodePsTexts(), it would be nice to offer the choice not to move to the center but pass the coordinates to the Postscript block inserted.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/77
http://lemon.cs.elte.hu/trac/lemon/ticket/77Report#425: API for giving back the state of RandomFri, 15 Jul 2016 11:57:05 GMTFri, 15 Jul 2011 15:36:26 GMT<p>
In some cases, it would be nice if we could query the state (i.e. the current seed) of Random in a format that is savable to a text file and retrievable later.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/425
http://lemon.cs.elte.hu/trac/lemon/ticket/425Report#191: Benchmark questions related to PreflowThu, 05 Nov 2009 10:09:40 GMTSun, 30 Nov 2008 21:43:09 GMT<p>
There are some efficiency questions about the <code>Preflow</code> implementation, that require thorough benchmarking.
</p>
<ul><li><code>Elevator</code> or <code>LinkedElevator</code> should be used by default?
</li><li>The BFS implementation in the <code>init()</code> function could be made more efficient using only one vector and three indices (<code>first</code>, <code>last</code>, <code>new_level</code>).
</li><li>We should try very large instances and check again whether the current heuristics and the constant 20 factor that is used for them are really optimal or not.
</li><li>We should try Goldberg's new idea of partial augmentations. (However it should probably be a new class.)
</li></ul>Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/191
http://lemon.cs.elte.hu/trac/lemon/ticket/191Report#33: BenchmarkingFri, 02 Aug 2013 12:33:35 GMTThu, 20 Mar 2008 10:51:41 GMT<p>
Lemon seriously needs a benchmarking environment to test
</p>
<ul><li>the effect of implementation changes on the running time
</li><li>performance of different compilers ans optimization settings
</li></ul><p>
This environment should contain
</p>
<ul><li>scripts for automated testing.
</li><li>carefully chosen set test files and graph generators.
</li></ul>Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/33
http://lemon.cs.elte.hu/trac/lemon/ticket/33Report#421: Better DAG test and topological ordering implementationMon, 04 Mar 2013 16:55:55 GMTFri, 13 May 2011 17:16:52 GMT<p>
Currently all these functions use Dfs with a custom visitor. I have a feeling that a direct algorithm might be faster and/or more memory efficient. The algorithm I propose is the following:
</p>
<ul><li>Compute the in-degree of all nodes and store them in a <code>NodeMap</code> <code>deg</code>.
</li><li>Put all node <code>n</code> with <code>deg[n]==0</code> into a queue (or a stack) <code>q</code>.
</li><li>While <code>q</code> is not empty:
<ul><li>Get a node <code>n</code> from <code>g</code>. This is the next node in the topological order.
</li><li>For each out-arc <code>a</code> of <code>n</code>:
<ul><li>Decrease <code>deg[target(a)]</code> by 1
</li><li>If <code>deg[target(a)]==0</code> then put <code>target(a)</code> into <code>q</code>
</li></ul></li></ul></li></ul>Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/421
http://lemon.cs.elte.hu/trac/lemon/ticket/421Report#249: Bidirectional Bfs and DijkstraFri, 09 Dec 2011 16:15:47 GMTFri, 27 Mar 2009 16:19:17 GMT<p>
It would be nice to have bidirectional Bfs and Dijkstra implementation in LEMON for the s-t shortest path problem.
</p>
<p>
Theoretically it is simple: the algorithm should be started "in parallel" from the source node s on the original graph and from the target node t on the reversed graph. As soon as we have a node u for which both direction have set the final <em>dist</em> and <em>pred</em> values, we can finish searching and construct the s->t path form the s->u path and the opposite of the t->u path. It could be faster by about a factor of two due to smaller search spaces.
</p>
<p>
However it is not clear for me how difficult it would be to implement it.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/249
http://lemon.cs.elte.hu/trac/lemon/ticket/249Report#225: Binary graph file formatFri, 15 Jul 2016 11:31:16 GMTWed, 18 Feb 2009 06:52:21 GMT<p>
The <code>.lgf</code> format is nice, but the files become extremely large for big graphs.
</p>
<p>
In some cases it would be nice to have a version of <code>GraphReader</code>/<code>GraphWriter</code> using a much more condensed binary format while providing close to the same API and feature set.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/225
http://lemon.cs.elte.hu/trac/lemon/ticket/225Report#375: Both lower and upper supply bounds in Network simplexFri, 01 Mar 2013 19:00:09 GMTThu, 01 Jul 2010 05:15:34 GMT<p>
The idea is to extend Network Simplex so that the form of the problems are fully compatible with the one used by the LP solvers i.e.
</p>
<pre class="wiki">m_l<=Ax<=m_u
l<=x<=u
</pre>Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/375
http://lemon.cs.elte.hu/trac/lemon/ticket/375Report#310: Bounding box for Bezier-curvesTue, 18 Aug 2009 19:15:53 GMTTue, 18 Aug 2009 19:15:53 GMT<p>
The patch <a class="missing changeset" title="No changeset 1121710e18c9 in the repository">[1121710e18c9]</a> contains functions for bounding box computation of Bezier-curves.
</p>
Balazs Dezso
http://lemon.cs.elte.hu/trac/lemon/ticket/310
http://lemon.cs.elte.hu/trac/lemon/ticket/310Report#344: Cairo based version of graphToEps()Wed, 17 Feb 2010 06:05:45 GMTWed, 17 Feb 2010 06:05:45 GMT<p>
Currently graphToEps() directly generates its output .eps file. This is good because we do not depend on any third party library.
</p>
<p>
However using the cairo rendering backend would have a couple of advantages, most importantly it could directly create graphics in other formats like PDF, PNG (pixel graphics format) or SVG (editable vector graphics format). It would also allow easy integration to a GUI.
</p>
<p>
This enhancement could also be incorporated with <a class="assigned ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/86" title="#86: enhancement: Virtualmap based graphToEps(). (assigned)">#86</a>.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/344
http://lemon.cs.elte.hu/trac/lemon/ticket/344Report#365: Cannot include <lemon/adaptors.h> in any of my application source filesWed, 07 Aug 2013 14:29:46 GMTSun, 04 Apr 2010 05:12:15 GMT<p>
I am using the Gnu 4.4 compiler under MinGW with Codeblocks on Windows to build a large application. I cannot include <lemon/adaptors.h> or <lemon/connectivity.h> in my application without getting a stream of error messages I cannot figure out. My application must use these included file. I have placed error messages below.
</p>
<p>
Thanks for any help you can provide.
</p>
<pre class="wiki">C:\usr\include\lemon\adaptors.h|3459|error: expected nested-name-specifier before 'Value'|
C:\usr\include\lemon\adaptors.h|3459|error: expected ';' before 'Value'|
C:\usr\include\lemon\adaptors.h|3461|error: wrong number of template arguments (0, should be 2)|
C:\usr\include\lemon\bits\traits.h|155|error: provided for 'template<class Map, class Enable> struct lemon::MapTraits'|
C:\usr\include\lemon\adaptors.h|3462|error: wrong number of template arguments (0, should be 2)|
C:\usr\include\lemon\bits\traits.h|155|error: provided for 'template<class Map, class Enable> struct lemon::MapTraits'|
C:\usr\include\lemon\adaptors.h|3463|error: wrong number of template arguments (0, should be 2)|
C:\usr\include\lemon\bits\traits.h|155|error: provided for 'template<class Map, class Enable> struct lemon::MapTraits'|
C:\usr\include\lemon\adaptors.h|3464|error: wrong number of template arguments (0, should be 2)|
C:\usr\include\lemon\bits\traits.h|155|error: provided for 'template<class Map, class Enable> struct lemon::MapTraits'|
C:\usr\include\lemon\adaptors.h|3465|error: wrong number of template arguments (0, should be 2)|
C:\usr\include\lemon\bits\traits.h|155|error: provided for 'template<class Map, class Enable> struct lemon::MapTraits'|
C:\usr\include\lemon\adaptors.h|3468|error: expected ')' before ',' token|
C:\usr\include\lemon\adaptors.h|3472|error: ISO C++ forbids declaration of 'Value' with no type|
C:\usr\include\lemon\adaptors.h|3472|error: expected ';' before 'operator'|
C:\A+MyPrograms\CombinatoricsCalculator\src\graphs\algorithms\GraphAlgorithmCanvas.cpp|698|error: expected ';' at end of input|
C:\A+MyPrograms\CombinatoricsCalculator\src\graphs\algorithms\GraphAlgorithmCanvas.cpp|698|error: expected '}' at end of input|
C:\A+MyPrograms\CombinatoricsCalculator\src\graphs\algorithms\GraphAlgorithmCanvas.cpp|698|error: expected unqualified-id at end of input|
C:\A+MyPrograms\CombinatoricsCalculator\src\graphs\algorithms\GraphAlgorithmCanvas.cpp|698|error: expected '}' at end of input|
C:\usr\include\lemon\adaptors.h|3443|error: expected unqualified-id at end of input|
C:\usr\include\lemon\adaptors.h|3443|error: expected '}' at end of input|
||=== Build finished: 21 errors, 0 warnings ===|
</pre>William Ford
http://lemon.cs.elte.hu/trac/lemon/ticket/365
http://lemon.cs.elte.hu/trac/lemon/ticket/365Report#146: Cheap copy of maps (reference counting) PHASE II.Fri, 15 Jul 2016 11:22:32 GMTWed, 17 Sep 2008 14:06:45 GMT<p>
This is a follow-up of <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/137" title="#137: enhancement: Cheap copy of maps (reference counting) PHASE I. (closed: fixed)">#137</a>.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/146
http://lemon.cs.elte.hu/trac/lemon/ticket/146Report#292: Checker functions for min cost flowFri, 15 Jul 2016 11:37:17 GMTTue, 12 May 2009 10:50:33 GMT<p>
Maybe we could have checker functions for the minimum cost flow algorithms according to the test file. E.g. <code>checkFeasibility()</code> and <code>checkOptimality()</code> or <code>checkFlow()</code> and <code>checkPotential()</code>.
They would be similar to the checker functions of <code>Circulation</code>.
</p>
<p>
However it is questionable whether these functions should be introduced to all MCF algorithms or we should have them separetly, since the implementation would be independent form the algorithms.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/292
http://lemon.cs.elte.hu/trac/lemon/ticket/292Report#227: Command line tool for executing various algorithmsFri, 15 Jul 2016 11:34:29 GMTWed, 18 Feb 2009 07:38:13 GMT<p>
This tool would read a .lgf file and run an algorithm on it. Finally it would report about the result or write the solution into a file. It should provide a wide range of algorithms which could be selected with command line options.
</p>
<p>
This is somewhat similar to that are proposed in <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/226" title="#226: enhancement: DIMACS file solver (closed: fixed)">#226</a>, but I think they should be separate tools, as that one have a quite limited feature set, while this one will probably become a complex tool with tons of option with the time.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/227
http://lemon.cs.elte.hu/trac/lemon/ticket/227Report#373: Compile time assertionFri, 15 Jul 2016 11:43:33 GMTTue, 29 Jun 2010 14:06:30 GMT<p>
Compile time assertion would be useful in some cases (instead of LEMON_ASSERT).
</p>
<p>
A possible solution is the following:
</p>
<div class="wiki-code"><div class="code"><pre>template <bool> struct STATIC_ASSERT_FAILURE;
template <> struct STATIC_ASSERT_FAILURE<true> {};
template<int x> struct static_assert_test{};
#define LEMON_COMPILE_ASSERT(x) \
typedef static_assert_test<\
sizeof(STATIC_ASSERT_FAILURE< (bool)( x ) >)>\
_static_assert_typedef_
</pre></div></div><p>
It could be used like that:
</p>
<pre class="wiki">LEMON_COMPILE_ASSERT(numeric_limits<T>::is_integer);
</pre>Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/373
http://lemon.cs.elte.hu/trac/lemon/ticket/373Report#105: Consider using the "ziggurat" method in Random::gauss().Tue, 16 Nov 2010 09:02:28 GMTMon, 30 Jun 2008 11:55:05 GMT<p>
Currently, <a class="missing source">Random::gauss()</a> uses a Box-Muller transformation based method. Ziggurat method is reported to be a better way of generating normally distributed random numbers, though one should check if it is indeed noticeably better in practice.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/105
http://lemon.cs.elte.hu/trac/lemon/ticket/105Report#427: Create build() routine for StaticDigraph that allows # of arcs to be set explicitlyFri, 01 Mar 2013 19:00:09 GMTSun, 25 Sep 2011 03:23:52 GMT<p>
Hello,
</p>
<p>
I recently tried used <a class="missing wiki">StaticDigraph?</a> with an iterator that used a forward-only traversal concept, as it was a thin wrapper to some rather complicated underlying structures. The problem is that the std::distance() call cause the iterator to run through the entire set to get the number of arcs, even though this was something I knew beforehand. Rather than create some sort of clumsy workaround, I found it easy to add another version of build() that permitted one to pass in the number of arcs explicitly. It's possible that mine is a rare case, but in case people are interested, here is a patch that does this. It's complete with appropriate documentation changes.
</p>
Hoyt Koepke
http://lemon.cs.elte.hu/trac/lemon/ticket/427
http://lemon.cs.elte.hu/trac/lemon/ticket/427Report#415: Custom cost types in NetworkSimplexThu, 07 Mar 2013 08:04:13 GMTMon, 28 Feb 2011 15:29:05 GMT<p>
Duraid Madina proposed an enhancement for <code>NetworkSimplex</code>:
</p>
<pre class="wiki"> I have been using Lemon's network-simplex code for some time.
Recently I wanted to use it with a custom Cost type and int Value type.
In order to make this simpler, I have patched network_simplex.h
so that the Cost class/type does not need/use operator*.
At the moment, my patch requires that a custom Cost class must
still implement operator* for (Cost, int) pairs. However, this is only
for the initialization of ART_COST, and for totalCost(). It is also
possible to eliminate these uses of operator*, but I have not needed
to make these changes.
The patch consists of three things:
1) the addition of a unitMul() function for multiplying Costs by
"unit values" -1, 0 and 1
2) changing all occurences of Cost*unit value multipication to
calls to unitMul()
3) a small change to totalCost() allowing exact total costs to
be computed (requires the custom Cost class to provide Cost*Value
multiplication, but not Cost*Cost multiplication.)
There is one potential problem with the patch. On x86 machines
and "int" Cost type, there is a speed penalty of about 15%. This can be
eliminated through template specialization of the unitMul function for
"int" Costs, but I have not done this for two reasons:
1) It would be great if you could do it in your preferred "LEMON
style"
2) On some machines, such as ia64 (Itanium), the unitMul in the
attached patch actually leads to a speed _gain_ of about 10%. The
reason is that there does not seem to be any compiler which can
detect that the "*" can be replaced by predicated/conditional clears
and negations.
So rather than constant tempate specialization, perhaps
the choice of unitMul() implementation could be left to the user,
with a simple "*"-based implementation as default?
Anyway, I hope this patch makes sense and you consider it
for inclusion in your code. I would like to conclude by saying a
big "thank you!" for the excellent LEMON library!!
Yours sincerely,
Duraid MADINA
RIKEN
</pre>Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/415
http://lemon.cs.elte.hu/trac/lemon/ticket/415Report#247: DegMapWed, 04 Nov 2009 18:31:01 GMTFri, 27 Mar 2009 15:45:57 GMT<p>
There are <code>InDegMap</code> and <code>OutDegMap</code> classes for directed graphs. So it would be nice to have a <code>DegMap</code> class for undirected graphs. I see that both <code>InDegMap</code> and <code>OutDegMap</code> can be used for this purpose, but it would be better to have <code>DegMap</code> even if it is just an alias for one of these maps.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/247
http://lemon.cs.elte.hu/trac/lemon/ticket/247Report#201: Delaunay triangulationSun, 12 Oct 2014 15:22:03 GMTTue, 13 Jan 2009 11:13:23 GMT<p>
Delunay triangulation is actually implemented in <code>tools/lgf-gen.cc</code>, but it would be nice to have it as a separate tool in the core library.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/201
http://lemon.cs.elte.hu/trac/lemon/ticket/201Report#475: DigraphWriter<> always saves Arc labelMon, 12 Sep 2016 12:49:51 GMTTue, 10 Sep 2013 08:32:55 GMT<p>
The <code>DigraphWriter</code> class always saves an <code>label</code> map in the <code>@arcs</code> section, even if it is not given explicitly not Arcs are saved in the <code>@attributes</code> section. I think it is unnecessary to save an auto generated label map in this case.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/475
http://lemon.cs.elte.hu/trac/lemon/ticket/475Report#123: dim2::Point default constructorWed, 04 Nov 2009 18:46:29 GMTMon, 14 Jul 2008 08:09:53 GMT<p>
I think the default constructor of <code>dim2::Point</code> should set the point (0,0). It is a natural request for any class that provides <code>operator+</code> to be able to sum it correctly with a template function.
</p>
<p>
I also made benchmark tests. They showed that this variant is not slower than the current one.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/123
http://lemon.cs.elte.hu/trac/lemon/ticket/123Report#318: Document MapIt, ConstMapIt and ItemIt classes of standard mapsThu, 07 Mar 2013 09:44:01 GMTTue, 06 Oct 2009 06:09:40 GMT<p>
There are three iterator classes: <code>MapIt</code>, <code>ConstMapIt</code> and <code>ItemIt</code> for all standard graph maps, which seem to be useful. However they are neither documented nor tested in the concept classes. I think, they sohuld be.
</p>
<p>
This ticket is a follow-up of <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/311" title="#311: defect: Improvements for graphs (closed: fixed)">#311</a>.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/318
http://lemon.cs.elte.hu/trac/lemon/ticket/318Report#94: Easy erase in list graphsTue, 13 Oct 2009 10:55:30 GMTThu, 22 May 2008 18:25:57 GMT<p>
The arcs and nodes might be able to erase during an iteration very easy way in the list and smart graph implementations. If an iterator points to an arc or a node, and the item is deleted, then the increment should be valid operation until other change occurred on the graph. Of course, accessing such iterator should be avoided.
</p>
Balazs Dezso
http://lemon.cs.elte.hu/trac/lemon/ticket/94
http://lemon.cs.elte.hu/trac/lemon/ticket/94Report#370: Edge coloring algorithmsFri, 02 Aug 2013 12:29:22 GMTSun, 23 May 2010 04:33:16 GMT<p>
Hello,
</p>
<p>
for a project I am working on I had to implement a couple of edge
coloring algorithms. If there is any interest I could LEMON-ify them.
</p>
<p>
A valid edge coloring is a coloring of the edges so that each node has
no two incident edges colored in the same way.
</p>
<p>
What is implemented is:
</p>
<ul><li>An edge map to store valid colorings and that supports the queries
</li></ul><p>
needed by the algorithms in a fast way.
</p>
<ul><li>An algorithm that colors bipartite graphs using at most as many colors
</li></ul><p>
as the maximum node degree.
</p>
<ul><li>Vizing's algorithm to color general simple graphs using at most as
</li></ul><p>
many colors as the maximum node degree + 1.
</p>
<ul><li>Test cases
</li></ul><p>
Both algorithms are in O(m*n)
</p>
<p>
For general simple graphs it is not always possible to color them using
only maximum node degree. An example is K_3. Determining if this is
possible is NP-hard so Vizing's algorithm seems to be the best you can
get within polynomial time.
</p>
<p>
I've attached my code.
</p>
<p>
Best regards,
Ben Strasser
</p>
Ben Strasser
http://lemon.cs.elte.hu/trac/lemon/ticket/370
http://lemon.cs.elte.hu/trac/lemon/ticket/370Report#426: Expose CBC/CPL original interface in CbcMip and ClpLpTue, 19 Sep 2017 13:32:27 GMTMon, 15 Aug 2011 04:54:27 GMT<p>
Something like <a href="http://lemon.cs.elte.hu/pub/doc/1.2.2/a00148.html">GlpkBase::lpx*</a> would be a satisfactory solution.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/426
http://lemon.cs.elte.hu/trac/lemon/ticket/426Report#407: Extend random_test.ccFri, 15 Jul 2016 11:55:36 GMTSun, 09 Jan 2011 16:00:54 GMT<p>
This ticket is a follow-up of <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/101" title="#101: enhancement: Extend test cases for various tools (closed: done)">#101</a>.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/407
http://lemon.cs.elte.hu/trac/lemon/ticket/407Report#409: Extend unionfind_test.ccFri, 15 Jul 2016 11:55:50 GMTSun, 09 Jan 2011 16:04:18 GMT<p>
The following classes should be tested:
</p>
<ul><li><code>UnionFind</code>
</li><li><code>ExtendFindEnum</code>
</li><li><code>HeapUnionFind</code>
</li></ul><p>
This ticket is a follow-up of <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/101" title="#101: enhancement: Extend test cases for various tools (closed: done)">#101</a>.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/409
http://lemon.cs.elte.hu/trac/lemon/ticket/409Report#462: Extended run time checking in debug modeSat, 26 Oct 2013 18:47:31 GMTFri, 10 May 2013 08:17:23 GMT<p>
When using more graph instances of the same time (e.g. <code>ListDigraph</code>) in a code, it is a very common error that a <code>Node</code> or <code>Arc</code> is used with a different graph that they actually belong to. For example a <code>NodeMap</code> may be indexed by a node belonging to another graph. These kind of errors remain hidden during the compilation.
</p>
<p>
I propose adding a pointer to the owner graph to each <code>Node</code> and <code>Arc</code> objects, and check their the validity of the relevant graph and map operations. This feature would be turned on <em>in debug mode only</em>.
</p>
<p>
Two things are worth checking:
</p>
<ul><li>The item should belong to the corresponding graph
</li><li>The item should be valid (i.e. not <code>INVALID</code> and point to an existing item)
</li></ul><p>
Here is a --- maybe incomplete --- list where checking could be made:
</p>
<ul><li><code>source()</code>, <code>target()</code>, <code>u()</code>, <code>v()</code>, <code>runningNode()</code>, <code>baseNode()</code>
</li><li><code>id()</code>
</li><li>constructors of the iterators
</li><li><code>operator++()</code> of the iterators (validity check only)
</li><li><code>*Map<>::operator[]()'</code>, <code>*Map<>::set()'</code>,
</li><li><code>changeSource()</code>, <code>changeTarget()</code>, <code>reverse()</code>
</li></ul>Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/462
http://lemon.cs.elte.hu/trac/lemon/ticket/462Report#466: Extended std::vector<>Fri, 15 Jul 2016 12:03:18 GMTMon, 27 May 2013 07:28:12 GMT<p>
Based upon the idea of <a class="new ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/462" title="#462: enhancement: Extended run time checking in debug mode (new)">#462</a>.
</p>
<p>
We could implement a wrapper around <code>std::vector<></code> with the following two extra features.
</p>
<ul><li>A extra permanent iterator. It has the same functionality as <code>std::vector::iterator</code> but remains valid even when the vector is extended by new elements. Technically, it contains a pointer to the base vector plus an index.
</li><li>An <code>index</code> type. In non-debug mode it is just a <code>size_t</code>, but in debug mode it also contains a pointer to the vector it indexes, thus <code>operator[]()</code> is able to check if the index indexes the right vector (and also if it is in the actual range).
</li></ul><p>
Both would be safer alternatives to referencing <code>std::vector<></code>'s elements by integer indices.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/466
http://lemon.cs.elte.hu/trac/lemon/ticket/466Report#250: Extensions for the interface of pathsFri, 23 Mar 2018 15:06:13 GMTFri, 27 Mar 2009 16:33:36 GMT<ol><li>Path structures have a function <code>nth(int n)</code> for getting the <em>n</em> th arc of the path. I suggest <code>operator[]</code> as an alias for this function.
</li></ol><ol start="2"><li><del>It would be nice to have <code>source()</code> and <code>target()</code> functions for paths. But it raise questions.</del>
<ul><li><del>Is it necessary that all the arcs in a path are directed in the same direction? Or we could store oppositely directed arc in a path as well? How should we define the source/target? Would the source node be equal to <code>gr.source(path.front())</code> and the target to <code>gr.target(path.back())</code>?</del>
</li><li><del>Should paths store source and target nodes explicitly? It would make it possible to handle paths of zero length (with a specified starting node).</del>
</li></ul></li></ol>Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/250
http://lemon.cs.elte.hu/trac/lemon/ticket/250Report#300: Faster building of heapsWed, 04 Nov 2009 18:28:31 GMTWed, 08 Jul 2009 16:09:49 GMT<p>
For some heap structures it is possible to build them from an existing list of <code>n</code> items faster than calling <code>push()</code> <code>n</code> times.
E.g. for binary heap calling <code>push()</code> for each item takes <code>O(n log n)</code> time, while a heap can be built in <code>O(n)</code> time.
</p>
<p>
It would be nice to indroduce <code>build()</code> (or something like that) member functions into those heap structures, for which it could be done faster than calling <code>push()</code> <code>n</code> times. Or maybe such a function could be introduced to the heap concept itself and all the heap structures (it could be implemented by calling <code>push()</code>, if it is not slower).
</p>
<p>
The main reason why we have heaps is to use them in algorithms like Dijkstra and Prim. These algorithms do not need such a function, but if one would like to use LEMON heaps for other purposes, it may be useful.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/300
http://lemon.cs.elte.hu/trac/lemon/ticket/300Report#604: Faster MaxMatching implementationWed, 06 Jul 2016 15:12:29 GMTWed, 06 Jul 2016 11:26:18 GMT<p>
From Joran van Apeldoorn:
</p>
<blockquote class="citation">
<p>
On odd graphs it does not notice when a perfect matching (as in (n-1)/2 matched edges) is found and continues to do a BFS from the one unmatched vertex, off course without result.
This makes the running time for slightly dense graphs a lot longer on odd graphs then on even graphs, to the extend that it can take easely a 100 times longer on odd graphs.
</p>
</blockquote>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/604
http://lemon.cs.elte.hu/trac/lemon/ticket/604Report#379: Find odd cyclesFri, 02 Jul 2010 21:58:23 GMTFri, 02 Jul 2010 21:58:23 GMT<p>
We could extend the functions <code>bipartite()</code> and <code>bipartitePartitions()</code> so that they could return an odd cycle if the given graph is not bipartite.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/379
http://lemon.cs.elte.hu/trac/lemon/ticket/379Report#269: Function type interface for CirculationWed, 04 Nov 2009 18:30:25 GMTFri, 24 Apr 2009 14:49:56 GMT<p>
It would be nice to have a function type interface for Circulation.
It should have almost the same named parameters as NetworkSimplex (without costs), and it should be implemented without map copying to be as efficient as the class interface.
</p>
<p>
This ticket is a folow-up of <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/266" title="#266: task: Revise the interface of Circulation and Suurballe (closed: fixed)">#266</a>.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/269
http://lemon.cs.elte.hu/trac/lemon/ticket/269Report#451: Functionality to test graph data structure consistencyFri, 15 Jul 2016 12:02:28 GMTTue, 25 Sep 2012 04:58:01 GMT<p>
The graph implementations (and other complex data structures, too) could provide a <code>dsSelfCheck()</code> member function, which thoroughly tests the inner consistency of the underlying data structures. This could help testing the correctness of the graph operations, thus preventing us from bugs like <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/450" title="#450: defect: Serious bug in ListDigraph::erase(Node &) (closed: invalid)">#450</a>.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/451
http://lemon.cs.elte.hu/trac/lemon/ticket/451Report#374: Functions for weakly connected componentsSat, 02 Mar 2013 17:07:15 GMTTue, 29 Jun 2010 14:17:46 GMT<p>
I suggest to have the following functions:
</p>
<div class="wiki-code"><div class="code"><pre>bool weaklyConnected (const Digraph &graph);
int countWeaklyConnectedComponents (const Digraph &graph);
int weaklyConnectedComponents (const Digraph &graph, NodeMap &compMap);
</pre></div></div><p>
which would work the same way as <code>connected()</code>, <code>countConnectedComponents()</code> and <code>connectedComponents()</code> for the undirected version of the digraph.
</p>
<p>
These proposed functions could be implemented easily using the <code>Undirector</code> adaptor and the undirected connectivity tools.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/374
http://lemon.cs.elte.hu/trac/lemon/ticket/374Report#297: Graph and map serializerFri, 15 Jul 2016 11:37:30 GMTWed, 10 Jun 2009 10:22:47 GMT<p>
For real distributed computing, it would be nice to have a <em>serializer</em> for the graphs and the map structures.
</p>
<p>
By a <em>serializer</em> I mean a facility to represent a graph/map as a compact raw sequence of bytes that can be sent to another (local or remote) process and the graph/map can be reconstructed from it.
</p>
<p>
The raw data format should be compact and easy to code and decode, however it cannot be independent from the underlying graph representation, as we must keep the node/arc IDs at the graph reconstruction.
</p>
<p>
This proposal is somewhat related to <a class="new ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/225" title="#225: enhancement: Binary graph file format (new)">#225</a>.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/297
http://lemon.cs.elte.hu/trac/lemon/ticket/297Report#8: GraphToEps() doesn't show loop egdesMon, 03 Nov 2008 17:16:46 GMTMon, 21 Jan 2008 12:35:54 GMT<p>
Although it would be nice.
</p>
<blockquote>
<p>
This ticket is a copy of report #27 of the old bug tracking system. It refers to svn trunk -r2561.
</p>
</blockquote>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/8
http://lemon.cs.elte.hu/trac/lemon/ticket/8Report#357: Guidelines for run/init/startMon, 12 Sep 2016 12:42:15 GMTMon, 15 Mar 2010 22:36:53 GMT<p>
Please add a few guidelines to the documentation about what are the invariants, pre and post conditions guaranteed by all algorithm objects and about the intended usage pattern. This includes documenting whenever:
</p>
<ul><li>The graph object and/or map objects must be fully constructed when the constructor of the algorithm object is run. (This is relevant if the graph and the algorithms objects are member of the same class, as may happen with algorithm objects that use a graph transformation based reduction.)
</li></ul><ul><li>At what point may the graph and the other algorithm parameters no longer be changed anymore without causing a crash or without invalidating the results. Calling start after changing the graph without rerunning init is allowed to crash. Changing the graph after start has completed should invalidate the results (or maybe not but in that case that behavior should be documented).
</li></ul><ul><li>Must the destructor of the algorithm object run before running the destructor of the graph object?
</li></ul>Ben Strasser
http://lemon.cs.elte.hu/trac/lemon/ticket/357
http://lemon.cs.elte.hu/trac/lemon/ticket/357Report#367: Gurobi backend for the LP interfaceFri, 16 Apr 2010 08:12:41 GMTFri, 16 Apr 2010 08:12:41 GMT<p>
<a class="ext-link" href="http://www.gurobi.com/"><span class="icon"></span>Gurobi Optimizer</a> focuses on parallel optimization and it is of increasing popularity. AFAK, it is freely available for academic purposes, thus it would be nice if LEMON supported it.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/367
http://lemon.cs.elte.hu/trac/lemon/ticket/367Report#328: Heuristic MinCostFlow and MinCostMaxFlowFri, 15 Jul 2016 11:38:43 GMTFri, 13 Nov 2009 00:23:26 GMT<p>
It could be worthwhile to create a heuristic min cost flow solver class named <code>MinCostFlow</code>. It would have the same interface as the single algorithms, but it could try to select the best algorithm to run according to the parameters of the problem (size of the graph, density, max. capacity etc.). This class could be used in e.g. thew dimacs solver.
</p>
<p>
Similarly, we could have a heuristic <code>MinCostMaxFlow</code> using <code>Preflow</code> and <code>MinCostFlow</code>. Or the interface of <code>MinCostFlow</code> could be extended to support min cost max flow. See also <a class="assigned ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/244" title="#244: enhancement: Support min. cost max. flow in MCF classes (assigned)">#244</a>.
</p>
<p>
This ticket is a follow-up of <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/180" title="#180: task: Port the remaining min. cost flow algorithms (closed: done)">#180</a>.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/328
http://lemon.cs.elte.hu/trac/lemon/ticket/328Report#220: Implement a Dual Network Simplex algorithmMon, 23 Mar 2009 22:27:17 GMTSat, 14 Feb 2009 06:29:16 GMT<p>
The title says everything.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/220
http://lemon.cs.elte.hu/trac/lemon/ticket/220Report#412: Implement Dinitz algorithm for the max flow problemWed, 11 Jan 2012 09:42:32 GMTSun, 09 Jan 2011 16:30:53 GMT<p>
It would be nice to implement the "original" Dinitz algorithm for the max flow problem.
</p>
<p>
We have an implementation that uses dynamic trees, but it would be better to have a separate implementation without dynamic trees, as well.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/412
http://lemon.cs.elte.hu/trac/lemon/ticket/412Report#413: Implement Young-Tarjan-Orlin algorithm for min mean cycleWed, 11 Jan 2012 09:43:26 GMTSun, 09 Jan 2011 16:37:01 GMT<p>
It would be nice to implement the Young-Tarjan-Orlin algorithm for the minimum mean cycle problem.
</p>
<p>
According to several survey papers, it is one of the fastest solution methods for this problem (and its extension: the optimum cycle ratio problem). Another method that is highly efficient is Howard's algorithm, which is already implemented in LEMON.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/413
http://lemon.cs.elte.hu/trac/lemon/ticket/413Report#363: Implementing a planar graph typeThu, 20 Nov 2014 07:13:38 GMTFri, 19 Mar 2010 19:30:45 GMT<p>
My goal is to implement classes for planar graphs. The PlanarGraph class maintains a topology of nodes, edges and faces and provides algorithms that are characteristic to planar graphs. PlaneGraph extends this functionality with geometric properties, such as node coordinates and arc shapes.
</p>
gyorokp
http://lemon.cs.elte.hu/trac/lemon/ticket/363
http://lemon.cs.elte.hu/trac/lemon/ticket/363Report#183: Improve doc of ElevatorThu, 07 Mar 2013 09:44:17 GMTMon, 24 Nov 2008 10:22:17 GMT<p>
The documentation should describe the differences between <code>Elevator</code> and <code>LinkedElevator</code> and give some hints about their performance on specific tasks.
</p>
<p>
This is a follow-up of <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/174" title="#174: enhancement: Port the Elevator (closed: fixed)">#174</a>.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/183
http://lemon.cs.elte.hu/trac/lemon/ticket/183Report#338: Infinite capacities in PreflowTue, 09 Feb 2010 22:28:34 GMTTue, 09 Feb 2010 22:28:34 GMT<p>
Infinite (or very high) capacities typically cause problems in <code>Preflow</code>, since the algorithm usually saturate arcs.
</p>
<p>
This problem could be overcome by finding a finite cut and replace the huge capacities on the outgoing arcs of the source node with the value of the found cut if such a cut exists. Otherwise the max. flow value is infinite.
</p>
<p>
This solution could be implemented in the <code>Preflow</code> class itself or rather in a separate wrapper class (it should be used in the DIMACS solver utility, as well).
</p>
<p>
This ticket is a follow-up of <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/319" title="#319: enhancement: Infinite capacities in Preflow (closed: done)">#319</a>.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/338
http://lemon.cs.elte.hu/trac/lemon/ticket/338Report#284: LGF to EPS converter toolWed, 04 Nov 2009 18:29:44 GMTWed, 06 May 2009 08:33:32 GMT<p>
It would be nice to have a well configurable command line tool for converting LGF files into EPS.
</p>
<p>
Of course, it would be basically a command line wrapper around <code>graph_to_eps()</code>.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/284
http://lemon.cs.elte.hu/trac/lemon/ticket/284Report#237: Line graph implementationsTue, 03 Mar 2009 12:29:46 GMTTue, 03 Mar 2009 12:29:46 GMT<p>
They can either be adaptors or just simple tools for creating the line graph of a given graph similarly to the graph copying tools.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/237
http://lemon.cs.elte.hu/trac/lemon/ticket/237Report#3: ListGraph should store/update the number of edges and nodesFri, 02 Aug 2013 12:34:26 GMTMon, 21 Jan 2008 12:10:42 GMT<p>
Counting the number of edges and nodes is a frequent graph operation. Now, it takes linear time to get these values. Instead we might store these values and update them at every edge/node addition and deletion.
</p>
<p>
Of course this change would slow down these operations a bit.
</p>
<blockquote>
<p>
This ticket is a copy of report #8 of the old bug tracking system. It refers to svn trunk -r2460.
</p>
</blockquote>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/3
http://lemon.cs.elte.hu/trac/lemon/ticket/3Report#402: Maps don't initialize subseqnetly added graph elements to the map-constructor's initial value.Mon, 12 Sep 2016 12:49:13 GMTMon, 06 Dec 2010 23:30:42 GMT<p>
Greetings all.
</p>
<p>
I'm experiencing a ( perceived ) problem with Maps. Maps "know" when new elements in a graph are added, and provide a default value. One of the two constructors for a map allows a user ( me ) to specify this default value. I expect that, all elements of a graph will receive that value upon map-construction, and I expect subsequent graph element additions to also take on that value. I observe that, all elements of a graph *do* receive the default value upon map-construction, but *do not* set my specified default-value when new elements are subsequently added to the graph.
</p>
<p>
I have a test program, which I will attach.
</p>
<p>
I also have a diff against lemon/bits/{array,vector}_map.h that attempt to remedy this situation, and hopefully reinforce my expected behaviour.
</p>
<p>
Please advise on if this is in fact a bit, or if it is intentional by design and my understanding is incorrect.
</p>
Charles Wilcox
http://lemon.cs.elte.hu/trac/lemon/ticket/402
http://lemon.cs.elte.hu/trac/lemon/ticket/402Report#216: Member in Circulation to transform the solution to a basic oneFri, 15 Jul 2016 11:28:42 GMTSat, 14 Feb 2009 06:17:27 GMT<p>
Having a basic solution for the circulation problem is sometime quite useful, e.g. it can be used as a staring solution of the primal Network Simplex algorithm.
</p>
<p>
The interface should also provide the tree (or forest) of the basis.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/216
http://lemon.cs.elte.hu/trac/lemon/ticket/216Report#238: Min cut iterators in PreflowFri, 15 Jul 2016 11:32:03 GMTWed, 04 Mar 2009 22:02:45 GMT<p>
It would be nice to have iterators for obtaining the min. cut in <code>Preflow</code> class. E.g. there could be <code>MinCutNodeIt</code> and <code>MinCutArcIt</code> similarly to the ones in <code>GomoryHu</code> class (but note that in <code>Preflow</code> we have directed cuts).
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/238
http://lemon.cs.elte.hu/trac/lemon/ticket/238Report#399: Missing getter and streaming operator for Node/Arc idFri, 15 Jul 2016 11:54:02 GMTWed, 17 Nov 2010 15:57:10 GMT<p>
please implement a getter and streaming operator for the id field of the Node and Arc class. This would be very helpful. Always have to use the graph class is very inconvenient and sometimes not even possible. thx
</p>
tobi_connect
http://lemon.cs.elte.hu/trac/lemon/ticket/399
http://lemon.cs.elte.hu/trac/lemon/ticket/399Report#251: More efficient graph copyingFri, 15 Jul 2016 11:34:46 GMTFri, 27 Mar 2009 16:44:14 GMT<p>
Is there any way to make graph copying faster for graph types like <code>List(Di)Graph</code> and <code>Smart(Di)Graph</code>?
</p>
<p>
Maybe we could have specialized versions of <code>(di)graphCopy()</code> for the cases when both types are the same, e.g. list or smart graph, which function would directly copy the vectors that represent the graph.
</p>
<p>
I'm not sure about the implementation, but I think this method would have two advantages:
</p>
<ul><li>It could be faster.
</li><li>It would keep the node, arc and/or edge ids and the order of the items. Now if you have a <code>SmartDigraph</code> and copies it to another <code>SmartDigraph</code> structure, then the iteration orders of the nodes and arcs are reversed.
</li></ul>Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/251
http://lemon.cs.elte.hu/trac/lemon/ticket/251Report#400: MPL LpSolver/MipSolver backendFri, 15 Jul 2016 11:54:13 GMTFri, 19 Nov 2010 05:33:02 GMT<p>
The idea is to write an LP/MIP interface that is able to build up the problem, but when solving, it first create an MPL file, call the external command line solver, then parse back the output of the solver.
</p>
<p>
Of course it will be less efficient than using the C API of the same solver, but
</p>
<ul><li>it can be useful to have the LP program built up by our code in MPL format, so that we can play with the solver separately (e.g. for experimenting with the tuning options).
</li><li>for some legal reason, it may simply be impossible to link the mip/lp solver to our code.
</li></ul>Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/400
http://lemon.cs.elte.hu/trac/lemon/ticket/400Report#296: Multicommodity flow algorithmsThu, 05 Nov 2009 10:21:38 GMTTue, 26 May 2009 16:47:21 GMT<p>
It would be important to implement various multicommodity flow algorithms in LEMON. Approximation (and maybe exact) solution methods for fractional, integral and unsplittable multicommodity flow problems.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/296
http://lemon.cs.elte.hu/trac/lemon/ticket/296Report#222: Network Simplex alg. for a simplified problemSun, 09 Jan 2011 16:50:39 GMTSat, 14 Feb 2009 06:40:59 GMT<p>
A simpler (but in fact equivalent) form of the Network Flow Problems when we have no upper limit on the arcs. We can also assume that the lower limit is 0 everywhere.
</p>
<p>
In this case Network Simplex algorithms becomes much easier:
</p>
<ul><li>A basis is just a tree, and it's trivial to obtaine both the primal and the dual solutions from it.
</li><li>A starting dual feasible solution is just a feasible potential w.r.t. the cost, so it can be computed by a shortest path algorithm.
</li></ul>Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/222
http://lemon.cs.elte.hu/trac/lemon/ticket/222Report#76: New features for graphToEps()Mon, 03 Nov 2008 17:22:10 GMTThu, 03 Apr 2008 15:23:46 GMT<p>
Some additional features for <code>graphToEps()</code> would be nice to have.
For example:
</p>
<ul><li>The ability of setting linestyles, such az dotted, dashed etc.
</li><li>The ability of the assignment of a second color to the edges along with a percentage value. Then the edges would be colored with to color according to the percentage.
</li></ul>Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/76
http://lemon.cs.elte.hu/trac/lemon/ticket/76Report#345: Obtaining and storing the LP solutionFri, 01 Mar 2013 19:00:09 GMTFri, 19 Feb 2010 11:48:59 GMT<p>
It would be nice if the LP and MIP solver interfaces provided functions for obtaining the LP solution at once. We could use a class that can store the solution efficiently, i.e. it should store variable-value pairs for the non-zero valued variables.
</p>
<p>
This ticket is a follow-up of <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/326" title="#326: enhancement: MipSolver interface fixes and extension (closed: fixed)">#326</a>.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/345
http://lemon.cs.elte.hu/trac/lemon/ticket/345Report#37: operator= for RangeMap and SparseMapWed, 04 Nov 2009 18:45:17 GMTSat, 22 Mar 2008 17:50:14 GMT<p>
Now <code>operator=</code> function is private (without implementation) in <code>RangeMap</code> and <code>SparseMap</code> classes. Do we need public <code>operator=</code>?
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/37
http://lemon.cs.elte.hu/trac/lemon/ticket/37Report#218: Path decomposition subroutine in Preflow.Fri, 15 Jul 2016 11:29:07 GMTSat, 14 Feb 2009 06:22:08 GMT<p>
The title says everything.
</p>
<p>
See also <a class="assigned ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/217" title="#217: enhancement: Subroutine in Preflow alg. to make the solution cycle-less (assigned)">#217</a>.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/218
http://lemon.cs.elte.hu/trac/lemon/ticket/218Report#611: Planar drawing algorithm requires at least 3 nodesMon, 21 May 2018 11:17:41 GMTMon, 21 May 2018 11:17:41 GMT<p>
Planar drawing algorithm fails if it called with less than 3 nodes
</p>
Balazs Dezso
http://lemon.cs.elte.hu/trac/lemon/ticket/611
http://lemon.cs.elte.hu/trac/lemon/ticket/611Report#610: PlanarDrawing::run() is incompatible with the PlanarEmbedding algorithmTue, 15 May 2018 12:20:07 GMTTue, 15 May 2018 12:16:06 GMTBalazs Dezso
http://lemon.cs.elte.hu/trac/lemon/ticket/610
http://lemon.cs.elte.hu/trac/lemon/ticket/610Report#168: Port bipartite matching algorithmsFri, 02 Aug 2013 12:46:14 GMTTue, 04 Nov 2008 12:02:18 GMT<p>
This ticket is a follow-up of <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/48" title="#48: task: Port matching algorithms (closed: fixed)">#48</a>.
</p>
<p>
The following tools are affected:
</p>
<ul><li>lemon/bipartite_matching.h
</li><li>lemon/pr_bipartite_matching.h (I really dislike this filename)
</li><li>test/bipartite_matching_test.cc
</li></ul><p>
It also depends on <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/69" title="#69: task: Revise and port bipartite graphs (closed: fixed)">#69</a> (the port of the bipartite graphs).
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/168
http://lemon.cs.elte.hu/trac/lemon/ticket/168Report#64: Port constrained shortest path algorithmMon, 15 Dec 2008 16:05:21 GMTFri, 28 Mar 2008 13:06:02 GMT<p>
Namely, this file:
</p>
<ul><li>lemon/csp.h
</li></ul>Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/64
http://lemon.cs.elte.hu/trac/lemon/ticket/64Report#178: Port dynamic tree based max flow algs.Thu, 05 Nov 2009 10:21:07 GMTFri, 14 Nov 2008 10:34:10 GMT<p>
This ticket is a follow-up of <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/47" title="#47: task: Port network flow algorithms (closed: fixed)">#47</a>.
</p>
<p>
Affected files are:
</p>
<ul><li>lemon/dynamic_tree.h
</li><li>lemon/goldberg_tarjan.h
</li><li>lemon/dinitz_sleator_tarjan.h
</li></ul>Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/178
http://lemon.cs.elte.hu/trac/lemon/ticket/178Report#63: Port metaheuristicsSat, 03 Jul 2010 15:57:27 GMTFri, 28 Mar 2008 13:04:23 GMT<p>
The following files are affected.
</p>
<ul><li>lemon/tabu_search.h
</li><li>lemon/simann.h
</li><li>test/simann_test.cc
</li></ul>Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/63
http://lemon.cs.elte.hu/trac/lemon/ticket/63Report#200: Port sparse SubGraph adaptor from SVNThu, 05 Nov 2009 10:21:30 GMTTue, 13 Jan 2009 10:45:53 GMT<p>
The <code>SubGraph</code> class in the 0.x series stores the unhidden edges/nodes as a double linked list (just as <code>ListGraph</code> does), therefore it provides better performance than the <code>SubGraphAdaptor</code> when the subgraph is sparse.
</p>
<p>
<code>SubGraphAdaptor</code> has been renamed to <code>SubGraph</code> in the 1.x series, thus I suggest to call the linked list based implementation as <code>SparseSubGraph</code>.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/200
http://lemon.cs.elte.hu/trac/lemon/ticket/200Report#71: Port Steiner tree approximation algorithmMon, 24 Nov 2008 12:44:37 GMTFri, 28 Mar 2008 15:24:31 GMT<p>
Namely, the file
</p>
<ul><li>lemon/steiner.h
</li></ul>Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/71
http://lemon.cs.elte.hu/trac/lemon/ticket/71Report#351: Port the LP utilitiesFri, 15 Jul 2016 11:41:21 GMTSun, 28 Feb 2010 23:07:03 GMT<p>
Revise and port the Lp utilities from SVN, namely
</p>
<ul><li><code>lp_utils.h</code>
</li><li><code>lp_utils.cc</code>
</li></ul>Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/351
http://lemon.cs.elte.hu/trac/lemon/ticket/351Report#73: Port the remaining miscellaneous toolsWed, 07 Oct 2009 14:40:50 GMTFri, 28 Mar 2008 15:29:50 GMT<p>
The following files should be considered.
</p>
<ul><li>lemon/dist_log.h
</li><li>lemon/refptr.h
</li><li><del>lemon/iterable_maps.h</del>
</li><li>lemon/bits/debug_map.h
</li><li>lemon/matrix_maps.h
</li><li>lemon/polynomial.h
</li><li>lemon/concepts/matrix_maps.h
</li><li>lemon/map_iterator.h
</li></ul>Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/73
http://lemon.cs.elte.hu/trac/lemon/ticket/73Report#346: Port the remaining shortest path algorithmsFri, 15 Jul 2016 11:41:08 GMTFri, 19 Feb 2010 13:10:36 GMT<p>
The following files are affected:
</p>
<ul><li>lemon/floyd_warshall.h
</li><li>lemon/johnson.h
</li><li>lemon/dag_shortest_path.h
</li><li>test/all_pairs_shortest_path_test.cc
</li></ul><p>
This ticket is a follow-up of <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/51" title="#51: task: Port the remaining shortest path algorithms (closed: done)">#51</a>.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/346
http://lemon.cs.elte.hu/trac/lemon/ticket/346Report#59: Port the remaining spanning tree algorithmsFri, 08 Mar 2013 10:44:35 GMTFri, 28 Mar 2008 12:49:48 GMT<p>
The following files are affected.
</p>
<ul><li>lemon/fredman_tarjan.h
</li><li>lemon/prim.h
</li></ul>Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/59
http://lemon.cs.elte.hu/trac/lemon/ticket/59Report#70: Port VirtualMapsSun, 23 Nov 2008 08:28:59 GMTFri, 28 Mar 2008 15:22:47 GMT<p>
This affects
</p>
<ul><li>lemon/vmap.h
</li></ul><p>
but this tool is still in an early stage.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/70
http://lemon.cs.elte.hu/trac/lemon/ticket/70Report#151: Possible improvement in the function-type implementation of BFS/DFS/DijkstraSun, 02 Aug 2009 11:20:55 GMTWed, 24 Sep 2008 15:38:45 GMT<p>
This ticket is a follow-up of <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/96" title="#96: enhancement: Revise function-type interface of BFS/DFS/Dijkstra (closed: fixed)">#96</a>.
</p>
<p>
Maybe it would be better if we could avoid using <code>NodeMap</code>s (instead of <code>NullMap</code>s) as <code>PredMap</code> and <code>DistMap</code> structures in the cases when they are not necessary. So the default type of these maps would be a <code>NullMap</code> in <code>Bfs/Dfs/DijkstraWizardDefaultTraits</code> classes, and it would be changed only if it is really needed (i.e. <code>path()</code> and/or <code>dist()</code> named parameter is used).
</p>
<p>
Balazs suggested a solution for this, saying: "iff at least one s-t path search is queried, real pred map should be defined, and iff at least one length of an s-t path queried, real dist map should be used. It could be done with the <code>ForkMap</code>s".
</p>
<p>
It is a benchmark question however, that this implementation would be more efficient or not in practice.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/151
http://lemon.cs.elte.hu/trac/lemon/ticket/151Report#221: Primal Network Simplex algorithm with given starting solutionFri, 15 Jul 2016 11:29:23 GMTSat, 14 Feb 2009 06:32:24 GMT<p>
If a primal solution is available, then we don't need the extension of the underlying graphs, which may speed up the algorithm sometimes.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/221
http://lemon.cs.elte.hu/trac/lemon/ticket/221Report#271: Provide output in dimacs-solverFri, 15 Jul 2016 11:36:19 GMTFri, 24 Apr 2009 22:05:42 GMT<p>
Currently dimacs-solver reports only the shortest path length (distance), the max flow value or the min flow cost. It would be better to provide the full solution in DIMACS format.
</p>
<p>
For the max flow here is a relevant output format (from the webpage of A. V. Goldberg):<br />
<a class="ext-link" href="http://www.avglab.com/andrew/CATS/maxflow_formats.htm"><span class="icon"></span>http://www.avglab.com/andrew/CATS/maxflow_formats.htm</a>
</p>
<p>
This format can be used for min cost flow problems as well. I found an MCF solver that actually use this, see the attached sample file.
</p>
<p>
However I didn't find such output format for shortest path problems. There are various formats for correctness checking and performance reporting, but they are very specific to the 9th DIMACS implementation challenge and follow a slightly different concept.<br />
<a class="ext-link" href="http://www.dis.uniroma1.it/~challenge9/format.shtml"><span class="icon"></span>http://www.dis.uniroma1.it/~challenge9/format.shtml</a>
</p>
<p>
Maybe we should invent a shortest path output format according to the other dimacs input/output formats, or only provide output for the flow problems.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/271
http://lemon.cs.elte.hu/trac/lemon/ticket/271Report#235: Push-relabel max flow (Preflow) for undirected graphsWed, 25 Feb 2009 12:45:02 GMTWed, 25 Feb 2009 12:45:02 GMT<p>
The current Preflow algorithm works well on undirected graphs, however a specialized version for undirected graphs could more efficient than the current solution. The flow map could be <a class="missing wiki">EdgeMap?</a> in this case and the edges do not need to be iterated twice (outgoing and incoming arcs). I think the overall improvement could be a small factor both in time and storage complexity.
</p>
Balazs Dezso
http://lemon.cs.elte.hu/trac/lemon/ticket/235
http://lemon.cs.elte.hu/trac/lemon/ticket/235Report#385: QuadHeap instead of BinHeap in DijkstraFri, 15 Jul 2016 11:50:56 GMTSat, 31 Jul 2010 21:33:32 GMT<p>
It is questionable whether <code>Dijkstra</code> should use <code>QuadHeap</code> instead of <code>BinHeap</code> by default.
</p>
<p>
In theory, a fourary heap is at least as efficient as a binary heap independently of the actual use case. I made some benchmark tests in which <code>QuadHeap</code> turned out to be typically faster than <code>BinHeap</code>, especially when many <code>decrease()</code> operations are performed. See the benchmark results <a class="attachment" href="http://lemon.cs.elte.hu/trac/lemon/attachment/ticket/313/heap_benchmark_results.txt" title="Attachment 'heap_benchmark_results.txt' in Ticket #313">here</a><a class="trac-rawlink" href="http://lemon.cs.elte.hu/trac/lemon/raw-attachment/ticket/313/heap_benchmark_results.txt" title="Download"></a>. However, binary heap is the "standard" choice.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/385
http://lemon.cs.elte.hu/trac/lemon/ticket/385Report#98: Read-Write LoggerBoolMapMon, 12 Oct 2009 13:44:06 GMTSat, 14 Jun 2008 17:40:18 GMT<p>
LoggerBoolMap map is only writable, so e.g. it can be used for ProcessedMap, but it cannot be used for ReachedMap in Bfs, Dfs, Dijkstra.
</p>
<p>
Now the simplest way for creating such a map is
</p>
<div class="wiki-code"><div class="code"><pre>typedef LoggerBoolMap<...> LoggerMap;
BoolEdgeMap map;
LoggerMap log;
ForkMap<BoolEdgeMap, LoggerMap> m(map, log);
</pre></div></div>Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/98
http://lemon.cs.elte.hu/trac/lemon/ticket/98Report#431: Remember the lastly evaluated arcs in Circulation (and in Preflow)Sat, 09 Mar 2013 10:07:35 GMTSat, 10 Dec 2011 06:53:37 GMT<p>
The <a class="attachment" href="http://lemon.cs.elte.hu/trac/lemon/attachment/ticket/431/23a4fa3a7e62.patch" title="Attachment '23a4fa3a7e62.patch' in Ticket #431">attached patch</a><a class="trac-rawlink" href="http://lemon.cs.elte.hu/trac/lemon/raw-attachment/ticket/431/23a4fa3a7e62.patch" title="Download"></a> changes the behavior of <code>Circulation</code> class.
</p>
<p>
For each node, we now store the lastly evaluated arc, so we can continue from this arc instead of starting from the beginning when the node is evaluated again.
</p>
<p>
A test on a network of 32768 nodes and 262892 arcs (generated by <code>netgen</code>) shows a running time improvement of 24%. A much more comprehensive test would of course be necessary, but this number seems quite promising.
</p>
<p>
The same idea can (should?) also be applied to the <code>Preflow</code> class.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/431
http://lemon.cs.elte.hu/trac/lemon/ticket/431Report#313: Revise the implementation of PairingHeap and RadixHeapTue, 01 Sep 2009 19:58:47 GMTTue, 01 Sep 2009 19:43:45 GMT<p>
The implementation of <code>PairingHeap</code> and <code>RadixHeap</code> should be revised, since they could most likely be made more efficient.
</p>
<p>
For example, in LEDA (according to their tests) pairing heap is always faster than Fibonacci heap, moreover it is usually faster than binary heap. Radix heap is also very fast, it is usually better than both pairing and binary heaps. However according to my tests, <code>PairingHeap</code> and <code>RadixHeap</code> are almost always slower than <code>BinHeap</code> in LEMON.
</p>
<p>
LEDA results: <a class="ext-link" href="http://www.cs.elte.hu/~kiraly/sanyag.adatstr/LEDAbook.heaps.ps"><span class="icon"></span>http://www.cs.elte.hu/~kiraly/sanyag.adatstr/LEDAbook.heaps.ps</a>
</p>
<p>
Two hints for <code>PairingHeap</code>:
</p>
<ol><li>It does not contain the heuristic that the small heaps created by <code>push()</code> and <code>decrease()</code> operations are collected in a temporary storage and they are merged into the main heap only if it is necessary (e.g. in case of a <code>pop()</code> or <code>prio()</code>).
</li><li>The underlying binary tree is currently stored using two indices (pointers) and a bool value at each node. This needs less space than storing three indices (for the parent and the two children), but it is not clear if it is faster or slower. The latter representation should also be implemented and tested.
</li></ol><p>
Apart from that, there could be other points in which the code could be made better.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/313
http://lemon.cs.elte.hu/trac/lemon/ticket/313Report#358: Runtime complexity for every algorithmSun, 09 Jan 2011 17:00:27 GMTMon, 15 Mar 2010 22:39:55 GMT<p>
Some algorithms such as <code>MaxWeightedPerfectMatching</code> include the complexity of the runtime. Others such as <code>MaxMatching</code> do not. It might be nice to add this information to the documentation of every algorithm object.
</p>
Ben Strasser
http://lemon.cs.elte.hu/trac/lemon/ticket/358
http://lemon.cs.elte.hu/trac/lemon/ticket/358Report#246: s() and t() as an alias for source() and target()Fri, 15 Jul 2016 11:32:58 GMTFri, 27 Mar 2009 15:11:03 GMT<p>
As we have <code>u()</code> and <code>v()</code> for undirected graphs, it seems to be a good idea to have shorter alias names for <code>source()</code> and <code>target()</code>, e.g. <code>s()</code> and <code>t()</code>, since they are among the most frequently used functions.
</p>
<p>
What do you think about it?
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/246
http://lemon.cs.elte.hu/trac/lemon/ticket/246Report#355: SCIP MipSolver backendTue, 03 Dec 2013 21:12:00 GMTFri, 12 Mar 2010 09:39:38 GMT<p>
The title says everything. Please find Ambros Gleixner's beta version implementation attached. His comments comes below.
</p>
<blockquote>
<p>
Sziasztok,
</p>
</blockquote>
<blockquote>
<p>
attached is a beta version of the SCIP interface. There is one segfault
bug which I somehow cannot figure out. I will have to solve this with
my colleagues in Berlin.
</p>
</blockquote>
<blockquote>
<p>
Do you have some more extensive test files for the MIP interfaces
besides test/mip_test.cc? If so, I would be happy to run them.
</p>
</blockquote>
<blockquote>
<p>
Üdv,
ambros
</p>
</blockquote>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/355
http://lemon.cs.elte.hu/trac/lemon/ticket/355Report#381: Simplified heaps without priority updateFri, 15 Jul 2016 11:46:06 GMTWed, 21 Jul 2010 15:41:14 GMT<p>
The existing heap implementations in LEMON cointain an Item->int map to indicate the current location of each item. It is required to implement <code>increase()</code>, <code>decrease()</code>, <code>erase()</code>, etc. functions.
However, simplified heaps could be implemented with a limited functionality (<code>push()</code>, <code>pop()</code>, <code>top()</code>, <code>prio()</code>, <code>size()</code>, <code>empty()</code>, <code>clear()</code>, etc.) without this cross reference map. For such heaps, the basic <code>push()</code> and <code>pop()</code> operations could be implemented more efficiently, but the duplications of items could not be avoided.
</p>
<p>
A Dijkstra or Prim algorithm could be implemented with such heaps, but it would require slight modifications. A node should be pushed each time its distance label is updated (i.e. more than once in some cases), and the duplicate nodes should be skipped after each <code>pop()</code> operation.
</p>
<p>
It would be nice to introduce such implementations in LEMON. I think, they would lead to better performance in many practical cases, because not too many duplications would be expected on typical graphs. However, there are some problems with this proposal. First, such heaps would not conform to the current heap concept. Second, using them would require different implementation of the algorithms.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/381
http://lemon.cs.elte.hu/trac/lemon/ticket/381Report#252: Smaller iterator classes for some graph structuresThu, 07 Mar 2013 08:51:08 GMTFri, 27 Mar 2009 16:58:58 GMT<p>
All the <code>NodeIt</code>, <code>ArcIt</code>, <code>EdgeIt</code> etc. iterator classes stores a pointer for the underlying (di)graph. However it wouldn't be necessary in some cases.
</p>
<p>
E.g. <code>SmartDigraph::next(Node&)</code> and <code>SmartDigraph::next(Arc&)</code> are static functions. Thus <code>SmartDigraph::NodeIt</code> and <code>SmartDigraph::ArcIt</code> could be implemented without a pointer to the graph. The three <code>next()</code> functions of <code>SmartGraph</code> are not static, but they could/should be. The special graph structures (<code>FullGraph</code>, <code>HypercubeGraph</code>, <code>GridGraph</code>) also have static <code>next()</code> functions.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/252
http://lemon.cs.elte.hu/trac/lemon/ticket/252Report#377: Smaller version of StaticDigraphWed, 12 Apr 2017 15:16:52 GMTFri, 02 Jul 2010 20:39:29 GMT<p>
The current implementation of <code>StaticDigraph</code> stores <code>2n+4m</code> int values (for <code>n</code> nodes and <code>m</code> arcs). However, in many cases, one needs outgoing arc iteration only. For such cases, a static graph representation could be implemented with <code>n+2m</code> integers by fully omitting the outgoing and incomming arc lists (but arcs would be sorted by their source nodes).
</p>
<p>
The <code>NodeIt</code>, <code>ArcIt</code> and <code>OutArcIt</code> iterators could be implemented efficiently, but the basic iteration of the ougoing arcs would be somewhat slower (see <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/68" title="#68: task: Port static graph implementation (closed: done)">#68</a> for antecedents). For ensuring the compatibility with the <code>Digraph</code> interface, an <code>InArcIt</code> iterator should also be implemented, but it would be really slow (as slow as full arc iteration).
</p>
<p>
What do you think? Would this data structure make sense?
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/377
http://lemon.cs.elte.hu/trac/lemon/ticket/377Report#329: Sort outgoing arcs in the build() function of StaticDigraphFri, 15 Jul 2016 11:39:32 GMTFri, 13 Nov 2009 09:40:32 GMT<p>
In the <code>build()</code> function of <code>StaticDigraph</code> which takes another digraph as an argument, the outgoing arcs of each node are sorted
with respect to their target nodes.
</p>
<p>
It clearly makes the <code>build()</code> function (and copying a graph to <code>StaticDigraph</code>) somewhat slower. Preliminary tests showed a difference of about 15 percent. On the other hand, it could make the usage of the constructed graph more efficient due to better caching. However, the trade-off is not clear.
</p>
<p>
I suggest to make this sorting optional (e.g. by adding a bool parameter to the <code>build()</code> function). However, the default option is of high importance here, since it will be used by <code>DigraphCopy</code>.
</p>
<p>
This ticket is a follow-up of <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/68" title="#68: task: Port static graph implementation (closed: done)">#68</a>.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/329
http://lemon.cs.elte.hu/trac/lemon/ticket/329Report#287: Specify argument order for ArgParserFri, 01 Mar 2013 19:00:09 GMTFri, 08 May 2009 11:04:08 GMT<p>
I think it would be nice if the order in which <code>ArgParser</code> prints out the arguments and their documentations would be able to be changed. A good example is lgf-gen, for which a lot of command line arguments are printed and the alphabetical order makes them more difficult to overview.
</p>
<p>
I suggest two options: alphabetical order and the order in which the arguments were specified. The first one could be the default, but the second one could be selected as an alternative.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/287
http://lemon.cs.elte.hu/trac/lemon/ticket/287Report#224: Static graph mapsFri, 15 Jul 2016 11:29:50 GMTSat, 14 Feb 2009 20:02:38 GMT<p>
Sometimes it would be nice to have a map which is not registered in the alteration notifier of the graph.
</p>
<p>
One reason might be running time efficiency, but the more important is multi-thread applications (see <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/223" title="#223: enhancement: Thread safe graphs (closed: done)">#223</a>). Currently, it is not safe to run say two Dijkstra algorithms on the same graph in parallel, as they would allocate maps and register them into the alteration notifier simultaneously, which is not safe. Changing these map allocations to static one would solve this problem.
</p>
<p>
My suggestion is to use the standard maps with a special constructor for this purpose, e.g.
</p>
<pre class="wiki">ListGraph::NodeMap<int> map1(g,STATIC);
ListGraph::NodeMap<int> map1(g,15,STATIC);
</pre><p>
or
</p>
<pre class="wiki">ListGraph::NodeMap<int> map1(STATIC,g);
ListGraph::NodeMap<int> map1(STATIC,g,15);
</pre><p>
See also <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/223" title="#223: enhancement: Thread safe graphs (closed: done)">#223</a>.
</p>
<p>
<strong>'
</strong></p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/224
http://lemon.cs.elte.hu/trac/lemon/ticket/224Report#594: STL syle iterators - phase II.Thu, 08 Oct 2015 08:31:25 GMTTue, 14 Apr 2015 18:46:57 GMT<p>
STL style iterators could be also added to other places. These possibilities should be discussed here.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/594
http://lemon.cs.elte.hu/trac/lemon/ticket/594Report#32: Storing Arcs instead of OutArcIts in Dfs stackFri, 02 Aug 2013 12:34:35 GMTThu, 20 Mar 2008 10:47:17 GMT<p>
The OutArcIt contains an int data field and a pointer to the graph, while the Arc just stores the int member. If we used Arcs in the Dfs stack, that could decrease the memory request of Dfs and it may provide better runtime performance.
</p>
Balazs Dezso
http://lemon.cs.elte.hu/trac/lemon/ticket/32
http://lemon.cs.elte.hu/trac/lemon/ticket/32Report#217: Subroutine in Preflow alg. to make the solution cycle-lessFri, 15 Jul 2016 11:28:55 GMTSat, 14 Feb 2009 06:21:47 GMT<p>
The title says everything.
</p>
<p>
See also <a class="assigned ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/218" title="#218: enhancement: Path decomposition subroutine in Preflow. (assigned)">#218</a>.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/217
http://lemon.cs.elte.hu/trac/lemon/ticket/217Report#343: Support arbitrary precision integers and rationals in LEMONThu, 18 Feb 2010 05:17:23 GMTTue, 16 Feb 2010 05:19:02 GMT<p>
Of course we should rely on a third party library, but it would still be nice if e.g. dimacs-solver could provide dead true results.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/343
http://lemon.cs.elte.hu/trac/lemon/ticket/343Report#261: Support floating-point data in min-cost flow algorithmsThu, 25 May 2017 15:29:49 GMTSat, 11 Apr 2009 14:31:07 GMT<p>
This is a follow-up of <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/254" title="#254: enhancement: Support real value types in NetworkSimplex (closed: done)">#254</a>.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/261
http://lemon.cs.elte.hu/trac/lemon/ticket/261Report#244: Support min. cost max. flow in MCF classesFri, 15 Jul 2016 11:32:19 GMTWed, 25 Mar 2009 21:29:41 GMT<p>
The new concept of the min cost flow classes (see <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/234" title="#234: task: Port and revise Network Simplex algorithm (closed: fixed)">#234</a>) makes it easy to provide interface for the min. cost maximum flow problem, too.
</p>
<p>
For example, there could be a <code>maxFlow(Node s, Node t)</code> function, which could be used instead of <code>supplyMap()</code> and <code>stSupply()</code>. In this case <code>Preflow::runMinCut()</code> should be called to determine the max. flow value (instead of <code>Circualtion</code>), and the algorithm have to be initialized as if <code>stSupport()</code> was called with this flow value. However apart from that nothing have to be changed.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/244
http://lemon.cs.elte.hu/trac/lemon/ticket/244Report#139: Support short and long style parameters in ArgParserMon, 03 Nov 2008 17:17:01 GMTMon, 25 Aug 2008 16:19:35 GMT<p>
This is a follow-up of <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/104" title="#104: defect: Meaningless parameter in ArgParser::boolOption() (closed: fixed)">ticket:104</a>.
</p>
<p>
I would propose a member function like <code>void style(StyleEnum st)</code>, where the parameter <code>st</code> would choose from the following options:
</p>
<ul><li><strong>Short style</strong>, where the form of the parameters are
<pre class="wiki">-param value
</pre></li><li><strong>Long style</strong>, where the form of the parameters are
<pre class="wiki">-param=value
</pre></li><li><strong>Mixed style</strong>, where options starting with one dash use the short form while those starting with two use the long style.
</li></ul><p>
With this approach, one can implement POSIX compliant parameters.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/139
http://lemon.cs.elte.hu/trac/lemon/ticket/139Report#145: Support SunCC compilerFri, 15 Jul 2016 11:22:15 GMTFri, 12 Sep 2008 15:55:13 GMT<p>
Currently (as of <a class="changeset" href="http://lemon.cs.elte.hu/trac/lemon/changeset/c691064dfd4f/lemon" title="Merge">[c691064dfd4f]</a>), SunCC reports some pretty strange errors.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/145
http://lemon.cs.elte.hu/trac/lemon/ticket/145Report#452: time_measure.h uses obsolete headearsMon, 12 Sep 2016 12:49:38 GMTThu, 11 Oct 2012 13:20:07 GMT<p>
<a class="missing source">time_measure.h</a> includes obsolete (pre C++) headers, such as <code>unistd.h</code>, <code>sys/times.h</code> and <code>sys/time.h</code> which in turn define a couple of things in the global namespace. Using the C++ counterparts of these headers (I hope they exist) would be a better option.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/452
http://lemon.cs.elte.hu/trac/lemon/ticket/452Report#352: Tolerance in GomoryHuTue, 02 Mar 2010 09:08:31 GMTTue, 02 Mar 2010 09:07:56 GMT<p>
For <code>GomoryHu</code> class, <code>Tolerance</code> type/object cannot be set, but it could be useful. The tolerance could be passed to the Preflow instances used by the algorithm.
</p>
<p>
This ticket is a follow-up of <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/306" title="#306: task: Tolerance in min cut algorithms (closed: fixed)">#306</a>.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/352
http://lemon.cs.elte.hu/trac/lemon/ticket/352Report#361: Tolerance support in BellmanFordThu, 18 Mar 2010 07:25:06 GMTThu, 18 Mar 2010 00:31:54 GMT<p>
BellmanFord (and maybe Dijkstra as well) could construct and store an instance of the operation traits class and use the operation traits functionalities through this object. This makes it possible to have such op. traits objects that can hold an <em>epsilon</em> value or a tolerance instance. It would also be important to have set/get functions for this instance in the algorithm class(es).
</p>
<p>
This ticket is a follow-up of <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/51" title="#51: task: Port the remaining shortest path algorithms (closed: done)">#51</a> and <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/360" title="#360: defect: VS compilation error (closed: fixed)">#360</a>.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/361
http://lemon.cs.elte.hu/trac/lemon/ticket/361Report#378: Transitive closureFri, 02 Jul 2010 21:09:37 GMTFri, 02 Jul 2010 21:09:37 GMT<p>
It would be nice to have a tool that generates the transitive closure of an input graph to another graph (similarly to <code>digraphCopy()</code>).
</p>
<p>
There are efficient solution methods based on the computation of the strongly connected components and their topological order.
</p>
<p>
For more details see:<br />
<a class="ext-link" href="http://www.cs.hut.fi/~enu/thesis.html"><span class="icon"></span>http://www.cs.hut.fi/~enu/thesis.html</a>
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/378
http://lemon.cs.elte.hu/trac/lemon/ticket/378Report#85: Use eps.h for drawing in graphToEps()Mon, 03 Nov 2008 17:22:54 GMTThu, 17 Apr 2008 16:31:52 GMT<p>
We should consider using eps.h for the actual drawing in graphToEps().
</p>
<p>
See also <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/43" title="#43: task: Port graph_to_eps and eps.h (closed: fixed)">ticket:43</a>.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/85
http://lemon.cs.elte.hu/trac/lemon/ticket/85Report#152: Using processed map in Dijkstra::processed()Mon, 24 Nov 2008 11:59:41 GMTFri, 26 Sep 2008 04:31:33 GMT<p>
This ticket is a follow-up of <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/149" title="#149: task: Removing \todo commands (closed: fixed)">#149</a>.
</p>
<p>
Now <a class="missing source">Dijkstra::processed()</a> uses the heap to determine the return value whether or not the current <code>ProcessedMap</code> type is <code>NullMap</code> or not and whether it uses local map or not. It would be nice that the given processed map (<code>_processed</code>) is used if it is not of type <code>NullMap</code> and the heap is used otherwise.
</p>
<p>
I think it would need some template tricks to implement. Otherwise we could introduce a bool flag that shows whether <code>SetProcessedMap</code> or <code>SetStandardProcessedMap</code> named class parameters were used. But in the the later case extra codes in <code>DijkstraWizard</code> would also be needed, since it does not use the above named class parameters but defining a traits class explicitly.
</p>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/152
http://lemon.cs.elte.hu/trac/lemon/ticket/152Report#597: VF2 (sub)graph isomoprism algorithmSat, 07 Oct 2017 16:26:16 GMTFri, 15 May 2015 10:09:18 GMT<p>
The changesets <a class="changeset" href="http://lemon.cs.elte.hu/trac/lemon/changeset/a037254714b3/lemon" title="VF2 algorithm added (#597)
The implementation of this feature was ...">[a037254714b3]</a>, <a class="changeset" href="http://lemon.cs.elte.hu/trac/lemon/changeset/2f479109a71d/lemon" title="Documentation for VF2 (#597)
The implementation of this feature was ...">[2f479109a71d]</a> and <a class="changeset" href="http://lemon.cs.elte.hu/trac/lemon/changeset/f85ee41c84bc/lemon" title="Bugfix in Vf2 - missing initialization (#597)">[f85ee41c84bc]</a> implement a slightly modified version of the VF2 algorithm for finding isomorphic copy of a graph as subgraph of another. It can find either normal or induced subgraph, or an isomorphism between the two graphs. It is also capable of enumerating all possible embedding. Finally, nodes can be labeled in order to model different (i.e. unmatchable) node types.
</p>
<p>
The function type interface can be considered final, the base class may be refined later.
</p>
<p>
This development was sponsored by QuantumBio Inc.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/597
http://lemon.cs.elte.hu/trac/lemon/ticket/597Report#6: VGraph and VMapSun, 23 Nov 2008 08:28:10 GMTMon, 21 Jan 2008 12:29:31 GMT<p>
It would be nice to have maps and graph with virtual functions in their interface. They would be inherited from common base classes, and there would be factories to "virtualize" graphs and maps. All these would make it possible to avoid the use of templates when the speed is not an issue.
</p>
<p>
This ticket is a copy of report #24 of the old bug tracking system. It refers to release 0.5.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/6
http://lemon.cs.elte.hu/trac/lemon/ticket/6Report#86: Virtualmap based graphToEps().Wed, 17 Feb 2010 05:58:36 GMTThu, 17 Apr 2008 16:35:35 GMT<p>
A rewrite of graphToEps() using virtual-maps instead of named template parameters would result in a much faster compilation time, at a cost of a slower execution, which is not really an issue here.
</p>
<p>
See also <a class="closed ticket" href="http://lemon.cs.elte.hu/trac/lemon/ticket/43" title="#43: task: Port graph_to_eps and eps.h (closed: fixed)">ticket:43</a>.
</p>
Alpar Juttner
http://lemon.cs.elte.hu/trac/lemon/ticket/86
http://lemon.cs.elte.hu/trac/lemon/ticket/86Report#612: Windows compile issue due to macros IN and OUTMon, 16 Jul 2018 14:28:58 GMTMon, 16 Jul 2018 14:08:34 GMT<p>
Reported by Szabolcs Horvát on the lemon-user mailing list:
</p>
<blockquote class="citation">
<p>
The following problem caused me a lot of frustration, so I thought I'd share the solution with the rest of you.
</p>
<p>
I had some working LEMON-based code that I wrote on OS X, but then couldn't compile on Windows due to a few mysterious errors that seemed to come from the LEMON headers and not my own code.
</p>
<p>
The problem turned out to be that I was using LEMON in conjunction with a C library, which in turn includes <windows.h> on Windows (obviously not on OS X), which in turn defines the macros IN and OUT. LEMON uses these same names as template parameters, hence the errors.
</p>
<p>
A simple
#undef IN
#undef OUT
before including any LEMON headers will fix the problem. Doing this appears to be completely safe (perhaps LEMON could do it by default):
<a class="ext-link" href="https://stackoverflow.com/questions/35907493/in-and-out-macros-in-minwindef-h"><span class="icon"></span>https://stackoverflow.com/questions/35907493/in-and-out-macros-in-minwindef-h</a>
</p>
<p>
Szabolcs
</p>
</blockquote>
Peter Kovacs
http://lemon.cs.elte.hu/trac/lemon/ticket/612
http://lemon.cs.elte.hu/trac/lemon/ticket/612Report