| commit | 12be7ab4876f77fecfab903df70791623219b3da | [log] [tgz] |
|---|---|---|
| author | Georgios Pinitas <georgios.pinitas@arm.com> | Tue Jul 03 12:06:23 2018 +0100 |
| committer | Anthony Barbier <anthony.barbier@arm.com> | Fri Nov 02 16:54:10 2018 +0000 |
| tree | 1cfa6852e60948bee9db0831a9f3abc97a2031c8 | |
| parent | e39334c15c7fd141bb8173d5017ea5ca157fca2c [diff] [blame] |
COMPMID-1310: Create graph validation executables. Change-Id: I9e0b57b1b83fe5a95777cdaeddba6ecef650bafc Reviewed-on: https://eu-gerrit-1.euhpc.arm.com/138697 Reviewed-by: Anthony Barbier <anthony.barbier@arm.com> Tested-by: Jenkins <bsgcomp@arm.com>
diff --git a/arm_compute/graph/algorithms/BFS.h b/arm_compute/graph/algorithms/BFS.h index 36ca872..97292d7 100644 --- a/arm_compute/graph/algorithms/BFS.h +++ b/arm_compute/graph/algorithms/BFS.h
@@ -85,7 +85,7 @@ std::list<NodeID> queue; // Push inputs and mark as visited - for(auto &input : g.inputs()) + for(auto &input : g.nodes(NodeType::Input)) { if(input != EmptyNodeID) {