Changeset 1837:8dd6160ff699 in lemon0.x for gui/graph_displayer_canvasedge.cc
 Timestamp:
 11/29/05 20:31:58 (15 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2389
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

gui/graph_displayer_canvasedge.cc
r1825 r1837 9 9 min=edge_property_defaults[E_WIDTH]; 10 10 max=edge_property_defaults[E_WIDTH]; 11 Graph::EdgeMap<double> actual_map( mapstorage.graph,edge_property_defaults[E_WIDTH]);11 Graph::EdgeMap<double> actual_map((mainwin.mapstorage).graph,edge_property_defaults[E_WIDTH]); 12 12 13 13 if(edge==INVALID) 14 14 { 15 for (EdgeIt i( mapstorage.graph); i!=INVALID; ++i)15 for (EdgeIt i((mainwin.mapstorage).graph); i!=INVALID; ++i) 16 16 { 17 17 double v=fabs(actual_map[i]); … … 45 45 double min, max; 46 46 47 min= mapstorage.minOfEdgeMap(mapname);48 max= mapstorage.maxOfEdgeMap(mapname);49 actual_map=( mapstorage.edgemap_storage)[mapname];50 51 if(edge==INVALID) 52 { 53 for (EdgeIt i( mapstorage.graph); i!=INVALID; ++i)47 min=(mainwin.mapstorage).minOfEdgeMap(mapname); 48 max=(mainwin.mapstorage).maxOfEdgeMap(mapname); 49 actual_map=((mainwin.mapstorage).edgemap_storage)[mapname]; 50 51 if(edge==INVALID) 52 { 53 for (EdgeIt i((mainwin.mapstorage).graph); i!=INVALID; ++i) 54 54 { 55 55 double v=fabs((*actual_map)[i]); … … 84 84 //green in RGB 85 85 Graph::EdgeMap<double> * actual_map; 86 actual_map=( mapstorage.edgemap_storage)[mapname];86 actual_map=((mainwin.mapstorage).edgemap_storage)[mapname]; 87 87 88 88 double max, min; 89 89 90 max= mapstorage.maxOfEdgeMap(mapname);91 min= mapstorage.minOfEdgeMap(mapname);92 93 if(edge==INVALID) 94 { 95 for (EdgeIt i( mapstorage.graph); i!=INVALID; ++i)90 max=(mainwin.mapstorage).maxOfEdgeMap(mapname); 91 min=(mainwin.mapstorage).minOfEdgeMap(mapname); 92 93 if(edge==INVALID) 94 { 95 for (EdgeIt i((mainwin.mapstorage).graph); i!=INVALID; ++i) 96 96 { 97 97 double w=(*actual_map)[i]; … … 135 135 //the minimum of the nodemap to the range of 136 136 //green in RGB 137 Graph::EdgeMap<double> actual_map( mapstorage.graph,edge_property_defaults[E_COLOR]);137 Graph::EdgeMap<double> actual_map((mainwin.mapstorage).graph,edge_property_defaults[E_COLOR]); 138 138 139 139 double max, min; … … 144 144 if(edge==INVALID) 145 145 { 146 for (EdgeIt i( mapstorage.graph); i!=INVALID; ++i)146 for (EdgeIt i((mainwin.mapstorage).graph); i!=INVALID; ++i) 147 147 { 148 148 double w=actual_map[i]; … … 189 189 if(edge==INVALID) 190 190 { 191 for (EdgeIt i( mapstorage.graph); i!=INVALID; ++i)191 for (EdgeIt i((mainwin.mapstorage).graph); i!=INVALID; ++i) 192 192 { 193 193 edgemap_to_edit=mapname; 194 double number=(*( mapstorage.edgemap_storage)[mapname])[i];194 double number=(*((mainwin.mapstorage).edgemap_storage)[mapname])[i]; 195 195 196 196 std::ostringstream ostr; … … 203 203 else 204 204 { 205 double number=(*( mapstorage.edgemap_storage)[mapname])[edge];205 double number=(*((mainwin.mapstorage).edgemap_storage)[mapname])[edge]; 206 206 207 207 std::ostringstream ostr; … … 224 224 if(edge==INVALID) 225 225 { 226 for (EdgeIt i( mapstorage.graph); i!=INVALID; ++i)226 for (EdgeIt i((mainwin.mapstorage).graph); i!=INVALID; ++i) 227 227 { 228 228 edgemap_to_edit="";
Note: See TracChangeset
for help on using the changeset viewer.