p47068915
/
mindspore
forked from mindspore-Ecosystem/mindspore
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Optimization for BroadFirstSearchGraphCNodes function

This commit is contained in:
wuyongkang 2020-07-17 11:34:10 +08:00
parent 7c1b44731e
commit 284ce5825f
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
mindspore/ccsrc/utils/graph_utils.cc
View File

@ -25,7 +25,6 @@
#include <vector> #include <vector>
#include <string> #include <string>
#include <fstream> #include <fstream>
#include <queue>
#include <deque> #include <deque>
#include <set> #include <set>
@ -88,13 +87,14 @@ std::vector<AnfNodePtr> TopoSort(const AnfNodePtr &root, const SuccFunc &succ, c
// search the cnodes inside this graph only // search the cnodes inside this graph only
std::vector<CNodePtr> BroadFirstSearchGraphCNodes(CNodePtr ret) { std::vector<CNodePtr> BroadFirstSearchGraphCNodes(CNodePtr ret) {
std::queue<CNodePtr> todo; std::deque<CNodePtr> todo(1024);
todo.push(ret); todo.clear();
todo.push_back(ret);
std::vector<CNodePtr> sorted_nodes; std::vector<CNodePtr> sorted_nodes;
auto seen = NewSeenGeneration(); auto seen = NewSeenGeneration();
while (!todo.empty()) { while (!todo.empty()) {
CNodePtr top = todo.front(); CNodePtr top = todo.front();
todo.pop(); todo.pop_front();
sorted_nodes.push_back(top); sorted_nodes.push_back(top);
auto inputs = top->inputs(); auto inputs = top->inputs();
for (auto &item : inputs) { for (auto &item : inputs) {
@ -103,7 +103,7 @@ std::vector<CNodePtr> BroadFirstSearchGraphCNodes(CNodePtr ret) {
} }
if (item->isa<CNode>()) { if (item->isa<CNode>()) {
todo.push(item->cast<CNodePtr>()); todo.push_back(item->cast<CNodePtr>());
} }
item->seen_ = seen; item->seen_ = seen;
} }