diff -r 628c0b383d2f -r e664d8aa3f72 graph_displayer_canvas-edge.cc
--- a/graph_displayer_canvas-edge.cc	Wed Nov 30 13:24:23 2005 +0000
+++ b/graph_displayer_canvas-edge.cc	Tue Dec 06 10:53:38 2005 +0000
@@ -8,11 +8,11 @@
 
   min=edge_property_defaults[E_WIDTH];
   max=edge_property_defaults[E_WIDTH];
-  Graph::EdgeMap<double> actual_map((mainwin.mapstorage).graph,edge_property_defaults[E_WIDTH]);
+  Graph::EdgeMap<double> actual_map((mytab.mapstorage).graph,edge_property_defaults[E_WIDTH]);
   
   if(edge==INVALID)
     {
-      for (EdgeIt i((mainwin.mapstorage).graph); i!=INVALID; ++i)
+      for (EdgeIt i((mytab.mapstorage).graph); i!=INVALID; ++i)
 	{
 	  double v=fabs(actual_map[i]);
 	  int w;
@@ -44,13 +44,13 @@
   Graph::EdgeMap<double> * actual_map;
   double min, max;
 
-  min=(mainwin.mapstorage).minOfEdgeMap(mapname);
-  max=(mainwin.mapstorage).maxOfEdgeMap(mapname);
-  actual_map=((mainwin.mapstorage).edgemap_storage)[mapname];
+  min=(mytab.mapstorage).minOfEdgeMap(mapname);
+  max=(mytab.mapstorage).maxOfEdgeMap(mapname);
+  actual_map=((mytab.mapstorage).edgemap_storage)[mapname];
 
   if(edge==INVALID)
     {
-      for (EdgeIt i((mainwin.mapstorage).graph); i!=INVALID; ++i)
+      for (EdgeIt i((mytab.mapstorage).graph); i!=INVALID; ++i)
 	{
 	  double v=fabs((*actual_map)[i]);
 	  int w;
@@ -83,16 +83,16 @@
   //the minimum of the nodemap to the range of
   //green in RGB
   Graph::EdgeMap<double> * actual_map;
-  actual_map=((mainwin.mapstorage).edgemap_storage)[mapname];
+  actual_map=((mytab.mapstorage).edgemap_storage)[mapname];
 
   double max, min;
 
-  max=(mainwin.mapstorage).maxOfEdgeMap(mapname);
-  min=(mainwin.mapstorage).minOfEdgeMap(mapname);
+  max=(mytab.mapstorage).maxOfEdgeMap(mapname);
+  min=(mytab.mapstorage).minOfEdgeMap(mapname);
 
   if(edge==INVALID)
     {
-      for (EdgeIt i((mainwin.mapstorage).graph); i!=INVALID; ++i)
+      for (EdgeIt i((mytab.mapstorage).graph); i!=INVALID; ++i)
 	{
 	  double w=(*actual_map)[i];
 
@@ -134,7 +134,7 @@
   //function maps the range of the maximum and
   //the minimum of the nodemap to the range of
   //green in RGB
-  Graph::EdgeMap<double> actual_map((mainwin.mapstorage).graph,edge_property_defaults[E_COLOR]);
+  Graph::EdgeMap<double> actual_map((mytab.mapstorage).graph,edge_property_defaults[E_COLOR]);
 
   double max, min;
 
@@ -143,7 +143,7 @@
 
   if(edge==INVALID)
     {
-      for (EdgeIt i((mainwin.mapstorage).graph); i!=INVALID; ++i)
+      for (EdgeIt i((mytab.mapstorage).graph); i!=INVALID; ++i)
 	{
 	  double w=actual_map[i];
 
@@ -188,10 +188,10 @@
   
   if(edge==INVALID)
     {
-      for (EdgeIt i((mainwin.mapstorage).graph); i!=INVALID; ++i)
+      for (EdgeIt i((mytab.mapstorage).graph); i!=INVALID; ++i)
 	{
 	  edgemap_to_edit=mapname;
-	  double number=(*((mainwin.mapstorage).edgemap_storage)[mapname])[i];
+	  double number=(*((mytab.mapstorage).edgemap_storage)[mapname])[i];
 	  
 	  std::ostringstream ostr;
 	  ostr << number;
@@ -202,7 +202,7 @@
     }
   else
     {
-	  double number=(*((mainwin.mapstorage).edgemap_storage)[mapname])[edge];
+	  double number=(*((mytab.mapstorage).edgemap_storage)[mapname])[edge];
 
 	  std::ostringstream ostr;
 	  ostr << number;
@@ -223,7 +223,7 @@
   
   if(edge==INVALID)
     {
-      for (EdgeIt i((mainwin.mapstorage).graph); i!=INVALID; ++i)
+      for (EdgeIt i((mytab.mapstorage).graph); i!=INVALID; ++i)
 	{
 	  edgemap_to_edit="";
 	  edgetextmap[i]->property_text().set_value("");