Method BackwardBFS

core/lib/graph.cpp:844–906

}

void Graph::BackwardBFS(Graph* graph, std::vector<Node*>& starts, graph_visit_t func, bool input_ready)
{
    int node_number = graph->seq_nodes.size();
    std::vector<int> visited(node_number, 0);
    std::queue<Node*> visit_queue;

    std::set<Node*> in_graph;

    for(int i = 0; i < node_number; i++)
        in_graph.insert(graph->seq_nodes[i]);

    /* inital the visit list */
    for(unsigned int i = 0; i < starts.size(); i++)
    {
        Node* node = starts[i];
        bool pure_output_node = true;
        int output_num = node->GetOutputNum();

        for(int i = 0; i < output_num; i++)
        {
            Tensor* tensor = node->GetOutputTensorSeq(i);

            for(unsigned int k = 0; k < tensor->consumer.size(); k++)
            {
                Node* child = tensor->consumer[k]->owner;

                if(in_graph.count(child))
                {
                    pure_output_node = false;
                    break;
                }
            }
        }

        if(pure_output_node)
        {
            visit_queue.push(node);
            visited[node->GetNodeIndex()] = 1;
            func(graph, node);
        }
    }

    while(visit_queue.size())
    {
        Node* node = visit_queue.front();
        visit_queue.pop();

        int input_num = node->GetInputNum();

        for(int i = 0; i < input_num; i++)
        {
            Node* parent = node->GetParentNode(i);

            if(in_graph.count(parent) && !visited[parent->GetNodeIndex()] &&
               (!input_ready || AllChildVisited(graph, parent, visited, in_graph)))
            {
                visit_queue.push(parent);
                visited[parent->GetNodeIndex()] = 1;