375     typename subgraph<G>::vertex_descriptor u_local, v_global;  in add_vertex()  local
390             v_global = target(e_global, r);  in add_vertex()
391             if (g.find_vertex(v_global).second == true)  in add_vertex()
392             g.local_add_edge(u_local, g.global_to_local(v_global), e_global);  in add_vertex()
399             v_global = *vi;  in add_vertex()
400             if (v_global == u_global)  in add_vertex()
402             if (!g.find_vertex(v_global).second)  in add_vertex()
407                     g.local_add_edge(g.global_to_local(v_global), u_local, e_global);  in add_vertex()
514     void add_edge_recur_down(Vertex u_global, Vertex v_global, Edge e_global,
518     void children_add_edge(Vertex u_global, Vertex v_global, Edge e_global,  in children_add_edge()  argument
523                 (*i)->find_vertex(v_global).second)  in children_add_edge()
525                 add_edge_recur_down(u_global, v_global, e_global, **i, orig);  in children_add_edge()
531     void add_edge_recur_down(Vertex u_global, Vertex v_global, Edge e_global,  in add_edge_recur_down()  argument
539             boost::tie(v_local, v_in_subgraph) = g.find_vertex(v_global);  in add_edge_recur_down()
544         children_add_edge(u_global, v_global, e_global, g.m_children, orig);  in add_edge_recur_down()
549     add_edge_recur_up(Vertex u_global, Vertex v_global,  in add_edge_recur_up()  argument
556             boost::tie(e_global, inserted) = add_edge(u_global, v_global, ep, g.m_graph);  in add_edge_recur_up()
559             children_add_edge(u_global, v_global, e_global, g.m_children, orig);  in add_edge_recur_up()
562             return add_edge_recur_up(u_global, v_global, ep, *g.m_parent, orig);  in add_edge_recur_up()
605     void remove_edge_recur_down(Vertex u_global, Vertex v_global,
609     void children_remove_edge(Vertex u_global, Vertex v_global,  in children_remove_edge()  argument
614                (*i)->find_vertex(v_global).second)  in children_remove_edge()
616                 remove_edge_recur_down(u_global, v_global, **i);  in children_remove_edge()
622     void remove_edge_recur_down(Vertex u_global, Vertex v_global,  in remove_edge_recur_down()  argument
627         v_local = g.m_local_vertex[v_global];  in remove_edge_recur_down()
629         children_remove_edge(u_global, v_global, g.m_children);  in remove_edge_recur_down()
633     void remove_edge_recur_up(Vertex u_global, Vertex v_global,  in remove_edge_recur_up()  argument
637             remove_edge(u_global, v_global, g.m_graph);  in remove_edge_recur_up()
638             children_remove_edge(u_global, v_global, g.m_children);  in remove_edge_recur_up()
640             remove_edge_recur_up(u_global, v_global, *g.m_parent);  in remove_edge_recur_up()