COIN-OR::LEMON - Graph Library

Changes between Initial Version and Version 1 of Ticket #462, comment 8


Ignore:
Timestamp:
10/25/13 09:35:24 (10 years ago)
Author:
Peter Kovacs
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #462, comment 8

    initial v1  
    11Just a guess: in `checkDigraphErase()`, after deleting node `n4`, the code checks its outgoing and incoming arc list, which is obviously invalid. (The behavior of this should be undefined, but in the current implementation, the connecting arcs are deleted before node deletion, so the test passes unless new nodes are added again.)
     2
     3Anyway, it seems to be a copy-paste bug.