COIN-OR::LEMON - Graph Library

Opened 15 years ago

Closed 15 years ago

#195 closed defect (fixed)

Bug fix in ConEdgeIt implementation

Reported by: Peter Kovacs Owned by: Peter Kovacs
Priority: major Milestone: LEMON 1.1 release
Component: core Version: hg main
Keywords: Cc:
Revision id:


The attached patch contains a bug fix for ConEdgeIt.

Since the erroneous code is in the 1.0 branch, too, I made the patch on the top of [62f9787c516c]. However the only example I found to indicate the error uses adaptors.

Here it is:


using namespace lemon;

int main() {
  ListGraph graph;
  ListGraph::Node n1 = graph.addNode();
  ListGraph::Node n2 = graph.addNode();
  ListGraph::Node n3 = graph.addNode();
  checkGraphConEdgeList(undirector(graph), 6);

  return 0;

If you try to compile and run this code using [919878a41a60], it will fall into an infinite loop!

Attachments (1)

b0f74ca2e3ac.patch (1.1 KB) - added by Peter Kovacs 15 years ago.

Download all attachments as: .zip

Change History (2)

Changed 15 years ago by Peter Kovacs

Attachment: b0f74ca2e3ac.patch added

comment:1 Changed 15 years ago by Alpar Juttner

Resolution: fixed
Status: newclosed

[b0f74ca2e3ac] has been merged to both 1.0 and the main branch.

Note: See TracTickets for help on using tickets.