Home
last modified time | relevance | path

Searched refs:start_nodes (Results 1 – 2 of 2) sorted by relevance

/external/tensorflow/tensorflow/core/grappler/utils/
Dtraversal_test.cc50 std::vector<const NodeDef*> start_nodes = {&graph.node(4), &graph.node(5)}; in TEST() local
58 DfsTraversal(graph_view, start_nodes, TraversalDirection::kFollowOutputs, in TEST()
81 std::vector<const NodeDef*> start_nodes = {&graph.node(1), &graph.node(2)}; in TEST() local
89 DfsTraversal(graph_view, start_nodes, TraversalDirection::kFollowInputs, in TEST()
111 std::vector<const NodeDef*> start_nodes = {&graph.node(5)}; in TEST() local
119 DfsTraversal(graph_view, start_nodes, TraversalDirection::kFollowInputs, in TEST()
142 std::vector<const NodeDef*> start_nodes = {&graph.node(0)}; in TEST() local
150 DfsTraversal(graph_view, start_nodes, TraversalDirection::kFollowOutputs, in TEST()
179 std::vector<const NodeDef*> start_nodes = {&graph.node(0)}; in TEST() local
187 DfsTraversal(graph_view, start_nodes, TraversalDirection::kFollowOutputs, in TEST()
[all …]
/external/tensorflow/tensorflow/core/common_runtime/
Dfunction.cc1856 std::vector<Node*> start_nodes; in ToGraphDef() local
1859 start_nodes.push_back(n); in ToGraphDef()
1863 ReverseDFSFrom(*g, start_nodes, nullptr, [gdef, pretty, &inputs](Node* n) { in ToGraphDef()