LEMON: Ticket Query
http://lemon.cs.elte.hu/trac/lemon/query?status=!closed&component=documentation&order=priority
Library for Efficient Modeling and Optimization in Networksen-USLEMONhttp://lemon.cs.elte.hu/trac/lemon/chrome/site/lemon-logo.gif
http://lemon.cs.elte.hu/trac/lemon/query?status=!closed&component=documentation&order=priority
Trac 1.2.3
http://lemon.cs.elte.hu/trac/lemon/ticket/318
http://lemon.cs.elte.hu/trac/lemon/ticket/318#318: Document MapIt, ConstMapIt and ItemIt classes of standard mapsTue, 06 Oct 2009 06:09:40 GMTPeter Kovacs<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>
Resultshttp://lemon.cs.elte.hu/trac/lemon/ticket/318#changelog
http://lemon.cs.elte.hu/trac/lemon/ticket/357
http://lemon.cs.elte.hu/trac/lemon/ticket/357#357: Guidelines for run/init/startMon, 15 Mar 2010 22:36:53 GMTBen Strasser<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>Resultshttp://lemon.cs.elte.hu/trac/lemon/ticket/357#changelog
http://lemon.cs.elte.hu/trac/lemon/ticket/358
http://lemon.cs.elte.hu/trac/lemon/ticket/358#358: Runtime complexity for every algorithmMon, 15 Mar 2010 22:39:55 GMTBen Strasser<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>
Resultshttp://lemon.cs.elte.hu/trac/lemon/ticket/358#changelog