Method del_node

src/Tracker/graph/GTL/src/graph.cpp:254–305

//--------------------------------------------------------------------------

void graph::del_node(GTL::node n)
{
    assert (n.data);
    assert (n.data->owner == this);

    // delete edges

    while(n.in_edges_begin() != n.in_edges_end())
    {
	del_edge (*n.in_edges_begin());
    }

    while(n.out_edges_begin() != n.out_edges_end())
    {
	del_edge (*n.out_edges_begin());
    }

    //
    // delete hidden edges adjacent to n.  
    // 
    // [ TODO ] This is only a quick fix and should be thought
    // over some time or the other.
    // 

	edges_t::iterator it = hidden_edges.begin();
	edges_t::iterator end = hidden_edges.end();

    while (it != end)
    { 
	if (it->source() == n || it->target() == n)
	{
	    delete it->data;
	    it = hidden_edges.erase (it);
	}
	else
	{ 
	    ++it;
	}
    }

    // delete node

    pre_del_node_handler(n);

    nodes.erase(n.data->pos);
    --nodes_count;
    free_node_ids.push_back(n.data->id);
    ++free_node_ids_count;
    delete n.data;

    post_del_node_handler();
}

void graph::del_edge(GTL::edge e)
{