| 58 | } |
| 59 | |
| 60 | Node* Graph::FindNode(const std::string& node_name) |
| 61 | { |
| 62 | int len = node_name.size(); |
| 63 | |
| 64 | for(unsigned int i = 0; i < seq_nodes.size(); i++) |
| 65 | { |
| 66 | Node* node = seq_nodes[i]; |
| 67 | const std::string& target_name = node->GetName(); |
| 68 | |
| 69 | int start = target_name.size() - len; |
| 70 | |
| 71 | if(start) |
| 72 | continue; |
| 73 | |
| 74 | if(target_name == node_name) |
| 75 | return node; |
| 76 | } |
| 77 | |
| 78 | return nullptr; |
| 79 | } |
| 80 | |
| 81 | bool Graph::AddInputNode(const std::string& node_name) |
| 82 | { |