[tf.data] Avoid visiting the same node multiple times in ComputeHash.
PiperOrigin-RevId: 335672916 Change-Id: Ib7da5fc41938b772310b058eaf2fb9474bf466e3
This commit is contained in:
parent
acfb05435f
commit
d7bb5785ce
@ -161,6 +161,9 @@ class GraphHasher {
|
|||||||
while (!bfs_queue.empty()) {
|
while (!bfs_queue.empty()) {
|
||||||
const NodeDef* node = bfs_queue.front();
|
const NodeDef* node = bfs_queue.front();
|
||||||
bfs_queue.pop();
|
bfs_queue.pop();
|
||||||
|
if (visited.contains(node->name())) {
|
||||||
|
continue;
|
||||||
|
}
|
||||||
visited.insert(node->name());
|
visited.insert(node->name());
|
||||||
NodeRep node_rep;
|
NodeRep node_rep;
|
||||||
for (int i = 0; i < node->input_size(); ++i) {
|
for (int i = 0; i < node->input_size(); ++i) {
|
||||||
|
Loading…
x
Reference in New Issue
Block a user