ladanyi@53: #include "graph_displayer_canvas.h"
hegyi@167: #include <lemon/random.h>
alpar@59: #include <cmath>
ladanyi@6: 
hegyi@96: GraphDisplayerCanvas::GraphDisplayerCanvas(NoteBookTab & mainw) :
hegyi@94:   nodesmap(mainw.mapstorage.graph), edgesmap(mainw.mapstorage.graph), edgetextmap(mainw.mapstorage.graph),
hegyi@94:   nodetextmap(mainw.mapstorage.graph), displayed_graph(*(root()), 0, 0),
ladanyi@66:   isbutton(0), active_item(NULL), target_item(NULL), nodemap_to_edit(""),
hegyi@160:   edgemap_to_edit(""), autoscale(true), zoomtrack(false), radius_size(20), edge_width(10),
hegyi@172:   iterations(20), attraction(0.05), propulsation(40000), was_redesigned(false), is_drawn(false), mytab(mainw)
ladanyi@6: {
ladanyi@53:   //base event handler is move tool
ladanyi@53:   actual_handler=signal_event().connect(sigc::mem_fun(*this, &GraphDisplayerCanvas::moveEventHandler), false);
ladanyi@53:   actual_tool=MOVE;
hegyi@34: 
ladanyi@53:   active_node=INVALID;
ladanyi@53:   active_edge=INVALID;
ladanyi@53:   forming_edge=INVALID;
ladanyi@53: }
hegyi@9: 
ladanyi@53: GraphDisplayerCanvas::~GraphDisplayerCanvas()
ladanyi@53: {
hegyi@96:   for (NodeIt n((mytab.mapstorage).graph); n != INVALID; ++n)
hegyi@94:     {
hegyi@94:       delete nodesmap[n];
hegyi@94:       delete nodetextmap[n];
hegyi@94:     }
hegyi@94:   
hegyi@96:   for (EdgeIt e((mytab.mapstorage).graph); e != INVALID; ++e)
hegyi@94:     {
hegyi@94:       delete edgesmap[e];
hegyi@94:       delete edgetextmap[e];
hegyi@94:     }
hegyi@94: }
ladanyi@6: 
hegyi@94: void GraphDisplayerCanvas::propertyChange(bool itisedge, int prop)
hegyi@94: {
hegyi@94:   if(itisedge)
hegyi@94:     {
hegyi@94:       propertyUpdate(Edge(INVALID), prop);
hegyi@94:     }
hegyi@94:   else
hegyi@94:     {
hegyi@94:       propertyUpdate(Node(INVALID), prop);
hegyi@94:     }
hegyi@94: }
hegyi@94: 
hegyi@94: void GraphDisplayerCanvas::propertyUpdate(Edge edge)
hegyi@94: {
hegyi@94:   for(int i=0;i<EDGE_PROPERTY_NUM;i++)
hegyi@94:     {
hegyi@94:       propertyUpdate(edge, i);
hegyi@94:     }
hegyi@94: }
hegyi@94: 
hegyi@94: void GraphDisplayerCanvas::propertyUpdate(Node node)
hegyi@94: {
hegyi@94:   for(int i=0;i<NODE_PROPERTY_NUM;i++)
hegyi@94:     {
hegyi@94:       propertyUpdate(node, i);
hegyi@94:     }
hegyi@94: }
hegyi@94: 
hegyi@118: void GraphDisplayerCanvas::propertyUpdate(Node node, int prop)
hegyi@94: {
hegyi@96:   std::string mapname=mytab.getActiveNodeMap(prop);
hegyi@94: 
hegyi@172:   if(is_drawn)
hegyi@94:     {
hegyi@172:       if(mapname!="")
hegyi@94: 	{
hegyi@172: 	  if( ( ((mytab.mapstorage).nodemap_storage).find(mapname) != ((mytab.mapstorage).nodemap_storage).end() ) )
hegyi@172: 	    {
hegyi@172: 	      switch(prop)
hegyi@172: 		{
hegyi@172: 		case N_RADIUS:
hegyi@172: 		  changeNodeRadius(mapname, node);
hegyi@172: 		  break;
hegyi@172: 		case N_COLOR:
hegyi@172: 		  changeNodeColor(mapname, node);
hegyi@172: 		  break;
hegyi@172: 		case N_TEXT:
hegyi@172: 		  changeNodeText(mapname, node);
hegyi@172: 		  break;
hegyi@172: 		default:
hegyi@172: 		  std::cerr<<"Error\n";
hegyi@172: 		}
hegyi@172: 	    }
hegyi@172: 	}
hegyi@172:       else //mapname==""
hegyi@172: 	{
hegyi@172: 	  Node node=INVALID;	
hegyi@94: 	  switch(prop)
hegyi@94: 	    {
hegyi@94: 	    case N_RADIUS:
hegyi@172: 	      resetNodeRadius(node);
hegyi@94: 	      break;
hegyi@94: 	    case N_COLOR:
hegyi@172: 	      resetNodeColor(node);
hegyi@94: 	      break;
hegyi@94: 	    case N_TEXT:
hegyi@172: 	      resetNodeText(node);
hegyi@94: 	      break;
hegyi@94: 	    default:
hegyi@94: 	      std::cerr<<"Error\n";
hegyi@94: 	    }
hegyi@94: 	}
hegyi@94:     }
hegyi@94: }
hegyi@94: 
hegyi@118: void GraphDisplayerCanvas::propertyUpdate(Edge edge, int prop)
hegyi@94: {
hegyi@96:   std::string mapname=mytab.getActiveEdgeMap(prop);
hegyi@94: 
hegyi@172:   if(is_drawn)
hegyi@94:     {
hegyi@172:       if(mapname!="")
hegyi@172: 	{
hegyi@172: 	  if( ( ((mytab.mapstorage).edgemap_storage).find(mapname) != ((mytab.mapstorage).edgemap_storage).end() ) )
hegyi@172: 	    {
hegyi@172: 	      switch(prop)
hegyi@172: 		{
hegyi@172: 		case E_WIDTH:
hegyi@172: 		  changeEdgeWidth(mapname, edge);
hegyi@172: 		  break;
hegyi@172: 		case E_COLOR:
hegyi@172: 		  changeEdgeColor(mapname, edge);
hegyi@172: 		  break;
hegyi@172: 		case E_TEXT:
hegyi@172: 		  changeEdgeText(mapname, edge);
hegyi@172: 		  break;
hegyi@172: 		default:
hegyi@172: 		  std::cerr<<"Error\n";
hegyi@172: 		}
hegyi@172: 	    }
hegyi@172: 	}
hegyi@172:       else //mapname==""
hegyi@94: 	{
hegyi@94: 	  switch(prop)
hegyi@94: 	    {
hegyi@94: 	    case E_WIDTH:
hegyi@172: 	      resetEdgeWidth(edge);
hegyi@94: 	      break;
hegyi@94: 	    case E_COLOR:
hegyi@172: 	      resetEdgeColor(edge);
hegyi@94: 	      break;
hegyi@94: 	    case E_TEXT:
hegyi@172: 	      resetEdgeText(edge);
hegyi@94: 	      break;
hegyi@94: 	    default:
hegyi@94: 	      std::cerr<<"Error\n";
hegyi@94: 	    }
hegyi@94: 	}
hegyi@94:     }
ladanyi@53: }
ladanyi@53: 
ladanyi@53: void GraphDisplayerCanvas::drawGraph()
ladanyi@53: {
ladanyi@6:   //first edges are drawn, to hide joining with nodes later
ladanyi@6: 
hegyi@96:   for (EdgeIt i((mytab.mapstorage).graph); i!=INVALID; ++i)
ladanyi@6:   {
ladanyi@151:     if (mytab.mapstorage.graph.source(i) == mytab.mapstorage.graph.target(i))
ladanyi@151:     {
ladanyi@151:       edgesmap[i]=new LoopEdge(displayed_graph, i, *this);
ladanyi@151:     }
ladanyi@151:     else
ladanyi@151:     {
ladanyi@151:       edgesmap[i]=new BrokenEdge(displayed_graph, i, *this);
ladanyi@151:     }
ladanyi@6:     //initializing edge-text as well, to empty string
ladanyi@6: 
ladanyi@98:     XY text_pos=mytab.mapstorage.arrow_pos[i];
ladanyi@98:     text_pos+=(XY(10,10));
hegyi@25: 
hegyi@25:     edgetextmap[i]=new Gnome::Canvas::Text(displayed_graph, text_pos.x, text_pos.y, "");
hegyi@28:     edgetextmap[i]->property_fill_color().set_value("darkgreen");
hegyi@149:     edgetextmap[i]->signal_event().connect(sigc::mem_fun(*this, &GraphDisplayerCanvas::mapEditEventHandler), false);
ladanyi@63:     edgetextmap[i]->raise_to_top();
ladanyi@6:   }
ladanyi@6: 
ladanyi@6:   //afterwards nodes come to be drawn
ladanyi@6: 
hegyi@96:   for (NodeIt i((mytab.mapstorage).graph); i!=INVALID; ++i)
ladanyi@6:   {
ladanyi@6:     //drawing bule nodes, with black line around them
ladanyi@6: 
ladanyi@53:     nodesmap[i]=new Gnome::Canvas::Ellipse(
ladanyi@53:         displayed_graph,
hegyi@96:         (mytab.mapstorage).coords[i].x-20,
hegyi@96:         (mytab.mapstorage).coords[i].y-20,
hegyi@96:         (mytab.mapstorage).coords[i].x+20,
hegyi@96:         (mytab.mapstorage).coords[i].y+20);
ladanyi@6:     *(nodesmap[i]) << Gnome::Canvas::Properties::fill_color("blue");
ladanyi@6:     *(nodesmap[i]) << Gnome::Canvas::Properties::outline_color("black");
ladanyi@63:     nodesmap[i]->raise_to_top();
hegyi@28: 
hegyi@28:     //initializing edge-text as well, to empty string
hegyi@28: 
hegyi@150:     XY text_pos(
hegyi@96:         ((mytab.mapstorage).coords[i].x+node_property_defaults[N_RADIUS]+5),
hegyi@96:         ((mytab.mapstorage).coords[i].y+node_property_defaults[N_RADIUS]+5));
hegyi@28: 
ladanyi@53:     nodetextmap[i]=new Gnome::Canvas::Text(displayed_graph,
ladanyi@53:         text_pos.x, text_pos.y, "");
hegyi@28:     nodetextmap[i]->property_fill_color().set_value("darkblue");
hegyi@149:     nodetextmap[i]->signal_event().connect(sigc::mem_fun(*this, &GraphDisplayerCanvas::mapEditEventHandler), false);
ladanyi@63:     nodetextmap[i]->raise_to_top();
ladanyi@6:   }
ladanyi@6: 
hegyi@172:   is_drawn=true;
hegyi@172: 
hegyi@172:   //upon drawing graph
hegyi@172:   //properties have to
hegyi@172:   //be set in as well
hegyi@172:   for(int i=0;i<NODE_PROPERTY_NUM;i++)
hegyi@172:     {
hegyi@172:       propertyUpdate(Node(INVALID), i);
hegyi@172:     }
hegyi@172: 
hegyi@172:   for(int i=0;i<EDGE_PROPERTY_NUM;i++)
hegyi@172:     {
hegyi@172:       propertyUpdate(Edge(INVALID), i);
hegyi@172:     }
hegyi@172: 
ladanyi@6:   updateScrollRegion();
ladanyi@6: }
ladanyi@6: 
ladanyi@53: void GraphDisplayerCanvas::clear()
ladanyi@6: {
ladanyi@53:   active_node=INVALID;
ladanyi@53:   active_edge=INVALID;
ladanyi@53:   forming_edge=INVALID;
ladanyi@6: 
hegyi@96:   for (NodeIt n((mytab.mapstorage).graph); n != INVALID; ++n)
ladanyi@6:   {
ladanyi@53:     delete nodesmap[n];
ladanyi@53:     delete nodetextmap[n];
ladanyi@6:   }
ladanyi@6: 
hegyi@96:   for (EdgeIt e((mytab.mapstorage).graph); e != INVALID; ++e)
ladanyi@53:   {
ladanyi@53:     delete edgesmap[e];
ladanyi@53:     delete edgetextmap[e];
ladanyi@53:   }
hegyi@172: 
hegyi@172:   is_drawn=false;
ladanyi@6: }
hegyi@154: 
hegyi@157: void GraphDisplayerCanvas::setView(bool autoscale_p, bool zoomtrack_p, double width_p, double radius_p)
hegyi@154: {
hegyi@154:   autoscale=autoscale_p;
hegyi@157:   edge_width=width_p;
hegyi@157:   radius_size=radius_p;
hegyi@156: 
hegyi@156:   if((!zoomtrack) && zoomtrack_p)
hegyi@156:     {
hegyi@156:       fixed_zoom_factor=get_pixels_per_unit();
hegyi@156:     }
hegyi@156: 
hegyi@156:   zoomtrack=zoomtrack_p;
hegyi@156: 
hegyi@154:   propertyChange(false, N_RADIUS);
hegyi@157:   propertyChange(true, E_WIDTH);
hegyi@154: }
hegyi@154: 
hegyi@157: void GraphDisplayerCanvas::getView(bool & autoscale_p, bool & zoomtrack_p, double& width_p, double& radius_p)
hegyi@154: {
hegyi@154:   autoscale_p=autoscale;
hegyi@156:   zoomtrack_p=zoomtrack;
hegyi@157:   width_p=edge_width;
hegyi@157:   radius_p=radius_size;
hegyi@154: }
hegyi@160: 
hegyi@160: void GraphDisplayerCanvas::reDesignGraph()
hegyi@160: {
hegyi@166:   double min_dist=20;
hegyi@166:   double init_vector_length=25;
hegyi@166: 
hegyi@166:   if(!was_redesigned)
hegyi@166:     {
hegyi@166:       NodeIt i((mytab.mapstorage).graph);
hegyi@167: 
alpar@168:       dim2::Point<double> init(init_vector_length*rnd(),
alpar@168: 			       init_vector_length*rnd());
hegyi@166:       moveNode(init.x, init.y, nodesmap[i], i);
hegyi@166:       was_redesigned=true;
hegyi@166:     }
hegyi@166:   
hegyi@160: 
hegyi@160:   //iteration counter
hegyi@160:   for(int l=0;l<iterations;l++)
hegyi@160:     {
hegyi@160:       Graph::NodeMap<double> x(mytab.mapstorage.graph);
hegyi@160:       Graph::NodeMap<double> y(mytab.mapstorage.graph);
hegyi@160:       XYMap<Graph::NodeMap<double> > actual_forces;
hegyi@160:       actual_forces.setXMap(x);
hegyi@160:       actual_forces.setYMap(y);
hegyi@160: 
hegyi@160:       lemon::dim2::Point<double> delta;
hegyi@160: 
hegyi@160:       //count actual force for each nodes
hegyi@160:       for (NodeIt i((mytab.mapstorage).graph); i!=INVALID; ++i)
hegyi@160: 	{
hegyi@160: 	  //propulsation of nodes
hegyi@160: 	  for (NodeIt j((mytab.mapstorage).graph); j!=INVALID; ++j)
hegyi@160: 	    {
hegyi@160: 	      if(i!=j)
hegyi@160: 		{
hegyi@160: 		  delta=((mytab.mapstorage).coords[i]-(mytab.mapstorage).coords[j]);
hegyi@160: 
hegyi@160: 		  double length_sqr=delta.normSquare();
hegyi@160: 		  double length=sqrt(length_sqr);
hegyi@160: 		  if(length_sqr<min_dist)
hegyi@160: 		    {
hegyi@160: 		      length_sqr=min_dist;
hegyi@160: 		    }
hegyi@160: 
hegyi@160: 		  //normalize vector
hegyi@160: 		  delta/=length;
hegyi@160: 
hegyi@160: 		  //calculating propulsation strength
hegyi@160: 		  //greater distance menas smaller propulsation strength
hegyi@160: 		  delta*=propulsation/length_sqr;
hegyi@160: 		    
hegyi@160: 		  actual_forces.set(i,(actual_forces[i]+delta));
hegyi@160: 		}
hegyi@160: 	    }
hegyi@160: 	  //attraction of nodes, to which actual node is bound
hegyi@160: 	  for(OutEdgeIt ei((mytab.mapstorage).graph,i);ei!=INVALID;++ei)
hegyi@160: 	    {
hegyi@160: 	      delta=((mytab.mapstorage).coords[i]-(mytab.mapstorage).coords[mytab.mapstorage.graph.target(ei)]);
hegyi@160: 
hegyi@160: 	      double length_sqr=delta.normSquare();
hegyi@160: 	      double length=sqrt(length_sqr);
hegyi@160: 	      if(length_sqr<min_dist)
hegyi@160: 		{
hegyi@160: 		  length_sqr=min_dist;
hegyi@160: 		}
hegyi@160: 
hegyi@160: 	      //normalize vector
hegyi@160: 	      delta/=length;
hegyi@160: 
hegyi@160: 	      //calculating attraction strength
hegyi@160: 	      //greater distance means greater strength
hegyi@160: 	      delta*=attraction*length;
hegyi@160: 
hegyi@160: 	      actual_forces.set(i,actual_forces[i]-delta);
hegyi@160: 	    }
hegyi@160: 	  for(InEdgeIt ei((mytab.mapstorage).graph,i);ei!=INVALID;++ei)
hegyi@160: 	    {
hegyi@160: 	      delta=((mytab.mapstorage).coords[i]-(mytab.mapstorage).coords[mytab.mapstorage.graph.source(ei)]);
hegyi@160: 
hegyi@160: 	      double length_sqr=delta.normSquare();
hegyi@160: 	      double length=sqrt(length_sqr);
hegyi@160: 	      if(length_sqr<min_dist)
hegyi@160: 		{
hegyi@160: 		  length_sqr=min_dist;
hegyi@160: 		}
hegyi@160: 
hegyi@160: 	      //normalize vector
hegyi@160: 	      delta/=length;
hegyi@160: 
hegyi@160: 	      //calculating attraction strength
hegyi@160: 	      //greater distance means greater strength
hegyi@160: 	      delta*=attraction*length;
hegyi@160: 
hegyi@160: 	      actual_forces.set(i,actual_forces[i]-delta);
hegyi@160: 	    }
hegyi@160: 	}
hegyi@160:       for (NodeIt i((mytab.mapstorage).graph); i!=INVALID; ++i)
hegyi@160: 	{
hegyi@160: 	  moveNode(actual_forces[i].x, actual_forces[i].y, nodesmap[i], i);
hegyi@160: 	}
hegyi@160:     }
hegyi@160: }
hegyi@160: 
hegyi@160: void GraphDisplayerCanvas::get_design_data(double & attraction_p, double & propulsation_p, int & iterations_p)
hegyi@160: {
hegyi@160:   attraction_p=attraction;
hegyi@160:   propulsation_p=propulsation;
hegyi@160:   iterations_p=iterations;
hegyi@160: }
hegyi@160: 
hegyi@160: void GraphDisplayerCanvas::set_attraction(double attraction_p)
hegyi@160: {
hegyi@160:   attraction=attraction_p;
hegyi@160: }
hegyi@160: 
hegyi@160: void GraphDisplayerCanvas::set_propulsation(double propulsation_p)
hegyi@160: {
hegyi@160:   propulsation=propulsation_p;
hegyi@160: }
hegyi@160: 
hegyi@160: void GraphDisplayerCanvas::set_iteration(int iterations_p)
hegyi@160: {
hegyi@160:   iterations=iterations_p;
hegyi@160: }
hegyi@160: