386       typename subgraph<G>::vertex_descriptor v_global;  in add_vertex()  local
404                v_global = target(e_global, r);  in add_vertex()
405                if (g.find_vertex(v_global).second == true)  in add_vertex()
406                g.local_add_edge(u_local, g.global_to_local(v_global), e_global);  in add_vertex()
413                v_global = *vi;  in add_vertex()
414                if (v_global == u_global)  in add_vertex()
416                if (!g.find_vertex(v_global).second)  in add_vertex()
421                         g.local_add_edge(g.global_to_local(v_global), u_local, e_global);  in add_vertex()
528     void add_edge_recur_down(Vertex u_global, Vertex v_global, Edge e_global,
532     void children_add_edge(Vertex u_global, Vertex v_global, Edge e_global,  in children_add_edge()  argument
537                 (*i)->find_vertex(v_global).second)  in children_add_edge()
539                 add_edge_recur_down(u_global, v_global, e_global, **i, orig);  in children_add_edge()
545     void add_edge_recur_down(Vertex u_global, Vertex v_global, Edge e_global,  in add_edge_recur_down()  argument
553             boost::tie(v_local, v_in_subgraph) = g.find_vertex(v_global);  in add_edge_recur_down()
558         children_add_edge(u_global, v_global, e_global, g.m_children, orig);  in add_edge_recur_down()
563     add_edge_recur_up(Vertex u_global, Vertex v_global,  in add_edge_recur_up()  argument
570             boost::tie(e_global, inserted) = add_edge(u_global, v_global, ep, g.m_graph);  in add_edge_recur_up()
573             children_add_edge(u_global, v_global, e_global, g.m_children, orig);  in add_edge_recur_up()
576             return add_edge_recur_up(u_global, v_global, ep, *g.m_parent, orig);  in add_edge_recur_up()
619     void remove_edge_recur_down(Vertex u_global, Vertex v_global,
623     void children_remove_edge(Vertex u_global, Vertex v_global,  in children_remove_edge()  argument
628                (*i)->find_vertex(v_global).second)  in children_remove_edge()
630                 remove_edge_recur_down(u_global, v_global, **i);  in children_remove_edge()
636     void remove_edge_recur_down(Vertex u_global, Vertex v_global,  in remove_edge_recur_down()  argument
641         v_local = g.m_local_vertex[v_global];  in remove_edge_recur_down()
643         children_remove_edge(u_global, v_global, g.m_children);  in remove_edge_recur_down()
647     void remove_edge_recur_up(Vertex u_global, Vertex v_global,  in remove_edge_recur_up()  argument
651             remove_edge(u_global, v_global, g.m_graph);  in remove_edge_recur_up()
652             children_remove_edge(u_global, v_global, g.m_children);  in remove_edge_recur_up()
654             remove_edge_recur_up(u_global, v_global, *g.m_parent);  in remove_edge_recur_up()