Method StripGraph

core/lib/graph.cpp:542–606

}

void Graph::StripGraph(void)
{
    int node_number = seq_nodes.size();

    std::vector<Node*> new_seq;
    std::vector<int> access_flag(node_number, 0);

    /* make sure the node index is correct first */
    for(int i = 0; i < node_number; i++)
        seq_nodes[i]->SetNodeIndex(i);

    BFSVisit(this, output_nodes,
             graph_visit_t([&](Graph* graph, Node* node) { access_flag[node->GetNodeIndex()] = 1; }), true, false);

    /* assume all the nodes in seq_nodes are in order,
       so that we just simply collect them one by one  */

    for(int i = 0; i < node_number; i++)
    {
        if(access_flag[i])
        {
            new_seq.push_back(seq_nodes[i]);
        }
    }

    for(unsigned int i = 0; i < input_nodes.size(); i++)
    {
        int input_index = input_nodes[i]->GetNodeIndex();

        if(!access_flag[input_index])
        {
            access_flag[input_index] = 1;
            new_seq.insert(new_seq.begin(), input_nodes[i]);
        }
    }

    auto ir = seq_nodes.begin();

    // removing node that can not be visited
    for(int i = 0; i < node_number; i++)
    {
        if(access_flag[i])
        {
            ir++;
            continue;
        }

        Node* node = (*ir);
        ir = seq_nodes.erase(ir);

        if(!RemoveNode(node))
            break;
    }

    seq_nodes = new_seq;

    for(unsigned int i = 0; i < seq_nodes.size(); i++)
    {