COIN-OR::LEMON - Graph Library

Custom Query (493 matches)

Filters
 
Or
 
  
 
Columns

Show under each result:


Results (7 - 9 of 493)

1 2 3 4 5 6 7 8 9 10 11 12 13
Ticket Resolution Summary Owner Reporter
#599 fixed Typo in code example kpeter thoneyvazul
Description

During refreshing my experience with this nice library, I found a little typo in a code example of the documentation. A variable is declared with a name cm, but used as cap, resulting in non compiling code.

Due to the simplicity of the issue this is just cosmetic change.

#598 fixed ObserverProxy implementation bug alpar alpar
Description

From lemon-users by Pierre M:

Hi,

Thank you to develop and share the Lemon graph library.

By curiosity I have ran the code analyzer from Visual Studio on the Lemon library.

And it found some strange things in lemon/list_graph.hpp:

In all the ObserverProxy implementations we can see something like:

virtual void add(const std::vector<Node>& nodes) {
          for (int i = nodes.size() - 1; i >= 0; ++i) {
            snapshot.addNode(nodes[i]);
          }
        }

The increment step of the loop must be -- and not ++ !!

This error appears 18 times and must be fixed!

I'm using Lemon 1.3 and I have checked on the current mercurials files, the error is still there in the trunk.

Regards/ Cordialement, Pierre M

#596 invalid DFS depends on the order source nodes are added -- LEMON 1.3-1 alpar roboloni
Description

The nodes that are reached by DFS are wrong and depend on the order source nodes are added. The attached code implements a simple graph n0-->n3, n1-->n2 and adds n0 and n1 to the source nodes of DFS. Depending on the order either n2 or n3 is not reached.


output


add node 1 add node 0 node 3: reached node 2: NOT reached node 1: reached node 0: reached

add node 0 add node 1 node 3: NOT reached node 2: reached node 1: reached node 0: reached

1 2 3 4 5 6 7 8 9 10 11 12 13
Note: See TracQuery for help on using queries.