24.02.1
|
#include "arm_compute/graph/algorithms/TopologicalSort.h"
#include "arm_compute/graph/Graph.h"
#include "support/Iterable.h"
#include <list>
#include <stack>
Go to the source code of this file.
Namespaces | |
arm_compute | |
Copyright (c) 2017-2024 Arm Limited. | |
arm_compute::graph | |
arm_compute::graph::detail | |
Functions | |
bool | all_inputs_are_visited (const INode *node, const std::vector< bool > &visited) |
Checks if all the input dependencies of a node have been visited. More... | |
std::vector< NodeID > | bfs (Graph &g) |
Breadth first search traversal. More... | |
std::vector< NodeID > | dfs (Graph &g) |
Depth first search traversal. More... | |