| 35 | namespace TEngine { |
| 36 | |
| 37 | void Graph::DumpGraph(void) |
| 38 | { |
| 39 | LOG_INFO() << "Graph: " << name_ << " total nodes: " << seq_nodes.size() << std::endl; |
| 40 | |
| 41 | for(unsigned int i = 0; i < seq_nodes.size(); i++) |
| 42 | { |
| 43 | Node* p_node = seq_nodes[i]; |
| 44 | p_node->DumpNode(); |
| 45 | } |
| 46 | |
| 47 | LOG_INFO() << "Input Nodes: " << input_nodes.size() << std::endl; |
| 48 | for(unsigned i = 0; i < input_nodes.size(); i++) |
| 49 | { |
| 50 | LOG_INFO() << "\t" << i << ": " << input_nodes[i]->GetName() << std::endl; |
| 51 | } |
| 52 | |
| 53 | LOG_INFO() << "Output Nodes: " << output_nodes.size() << std::endl; |
| 54 | for(unsigned i = 0; i < output_nodes.size(); i++) |
| 55 | { |
| 56 | LOG_INFO() << "\t" << i << ": " << output_nodes[i]->GetName() << std::endl; |
| 57 | } |
| 58 | } |
| 59 | |
| 60 | Node* Graph::FindNode(const std::string& node_name) |
| 61 | { |