COIN-OR::LEMON - Graph Library

Changeset 2498:290e43cddc1a in lemon-0.x for lemon/list_graph.h


Ignore:
Timestamp:
10/19/07 17:21:07 (13 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3337
Message:

Bug fix in undirected graphs (adding loops)
Bug fix in undirected edgesets (alteration notifying)

Redesigned undirected edgesets (like the smart or ugraph)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/list_graph.h

    r2456 r2498  
    978978
    979979      edges[n].next_out = nodes[v.id].first_out;
    980       edges[n | 1].next_out = nodes[u.id].first_out;
    981980      if (nodes[v.id].first_out != -1) {
    982981        edges[nodes[v.id].first_out].prev_out = n;
    983       }
     982      }     
     983      edges[n].prev_out = -1;
     984      nodes[v.id].first_out = n;
     985     
     986      edges[n | 1].next_out = nodes[u.id].first_out;
    984987      if (nodes[u.id].first_out != -1) {
    985988        edges[nodes[u.id].first_out].prev_out = (n | 1);
    986989      }
    987      
    988       edges[n].prev_out = edges[n | 1].prev_out = -1;
    989        
    990       nodes[v.id].first_out = n;
     990      edges[n | 1].prev_out = -1;     
    991991      nodes[u.id].first_out = (n | 1);
    992992
Note: See TracChangeset for help on using the changeset viewer.