Lines Matching refs:graph_def
33 void GetOrder(const GraphDef& graph_def, std::map<string, int>* order) {
34 for (int i = 0; i < graph_def.node_size(); ++i) {
35 const NodeDef& node = graph_def.node(i);
41 GraphDef graph_def;
42 NodeDef* add_node = graph_def.add_node();
48 NodeDef* b_node = graph_def.add_node();
52 NodeDef* a_node = graph_def.add_node();
57 TF_ASSERT_OK(SortByExecutionOrder(graph_def, &result));
67 GraphDef graph_def;
69 NodeDef* negative_node = graph_def.add_node();
74 NodeDef* relu_node = graph_def.add_node();
79 NodeDef* sqrt_node = graph_def.add_node();
84 NodeDef* const_node = graph_def.add_node();
89 TF_ASSERT_OK(SortByExecutionOrder(graph_def, &result));
100 GraphDef graph_def;
102 NodeDef* add_node1 = graph_def.add_node();
108 NodeDef* add_node2 = graph_def.add_node();
114 NodeDef* add_node3 = graph_def.add_node();
120 NodeDef* const_node1 = graph_def.add_node();
124 NodeDef* const_node2 = graph_def.add_node();
128 NodeDef* const_node3 = graph_def.add_node();
132 NodeDef* const_node4 = graph_def.add_node();
137 TF_ASSERT_OK(SortByExecutionOrder(graph_def, &result));
151 GraphDef graph_def;
153 NodeDef* add_node1 = graph_def.add_node();
159 NodeDef* add_node2 = graph_def.add_node();
165 NodeDef* add_node3 = graph_def.add_node();
171 NodeDef* const_node1 = graph_def.add_node();
175 NodeDef* const_node2 = graph_def.add_node();
179 NodeDef* const_node3 = graph_def.add_node();
184 TF_ASSERT_OK(SortByExecutionOrder(graph_def, &result));
