private void reInsertEdgesInRightGraph(EdgeCursor ec)
	{
		System.out.println("this is inside the reinsertion of edge");
		Graph2D right_graph = view.getGraph2D();
		System.out.println("-----------INITIAL VIDS---------");
		for (int i = 0; i < v_edge_list_2.size();i++)
		{
			UUID v = ((VEdge) v_edge_list_2.get(i)).uuid;
			System.out.println("vid "+i+"="+v);
		}
		System.out.println("-----------END---------");
		
		if (ec != null)
		{
			for (; ec.ok(); ec.next())
			{
				Edge edge = ec.edge();
				UUID vid = VEdge.getEdgeVid(edge,v_edge_list_1);
				UUID vid_node_source = VNode.getNodeVid(edge.source(),v_node_list_1);
				UUID vid_node_target = VNode.getNodeVid(edge.target(),v_node_list_1);
				Node source_node,target_node;
				source_node = VNode.getNodeFromNodeList(vid_node_source,v_node_list_2);
				target_node = VNode.getNodeFromNodeList(vid_node_target,v_node_list_2);
				if (source_node == null)
				{
					System.out.println("for edge "+edge+" source is null, so continuing");
					for (int i = 0; i < v_edge_list_2.size();i++)
					{
						UUID v = ((VEdge) v_edge_list_2.get(i)).uuid;
						System.out.println("vid "+i+"="+v);
					}
					continue;
				}
				 if (target_node == null)
				 {
						System.out.println("for edge "+edge+" target is null, so continuing");
					 continue;
				 }
				System.out.println("source node:"+source_node+"target:"+target_node);
				//getNodeFromNodeList
				//boolean c1 = !VEdge.edge_vid_exists(vid,v_edge_list_2);
				//boolean c2 = right_graph.contains(source_node);
				//boolean c3 = right_graph.contains(target_node);
				
				//System.out.println("c1:"+c1+"c2:"+c2+"c3"+c3+"vid:"+vid);
				//print all vids
				/*for (int i = 0; i < v_edge_list_2.size();i++)
				{
					int v = ((VEdge) v_edge_list_2.get(i)).vid;
					System.out.println("vid "+i+"="+v);
				}*/
				if(!VEdge.edge_vid_exists(vid,v_edge_list_2) && right_graph.contains(source_node) && right_graph.contains(target_node)) 
				{
					EdgeRealizer er = left_view.getGraph2D().getRealizer(edge).createCopy();
					Edge new_edge = right_graph.createEdge(source_node,target_node,er);
					VEdge new_vedge = new VEdge(new_edge,vid);
					v_edge_list_2.add(new_vedge);
					right_graph.updateViews();
				}
			}	
		}
		view.updateView();
	}