Custom Query (545 matches)
Results (55 - 57 of 545)
Ticket | Resolution | Summary | Owner | Reporter |
---|---|---|---|---|
#598 | fixed | ObserverProxy implementation bug | ||
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 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 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 | ||
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 |
|||
#595 | fixed | MinGW (codeblocks) compilation problem | ||
Description |
We use
This link indicates that this is actually the expected behaviour. The compiler normally defines What shall we do? I can imagine the following resolutions.
into
We may define Which option do you prefer? |