arm_compute/graph/algorithms/TopologicalSort.h

/*
 * Copyright (c) 2018-2019 Arm Limited.
 *
 * SPDX-License-Identifier: MIT
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to
 * deal in the Software without restriction, including without limitation the
 * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
 * sell copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in all
 * copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */
#ifndef ARM_COMPUTE_GRAPH_ALGORITHM_TOPOLOGICAL_SORT_H
#define ARM_COMPUTE_GRAPH_ALGORITHM_TOPOLOGICAL_SORT_H

#include "arm_compute/graph/Types.h"

#include <vector>

namespace arm_compute
{
namespace graph
{
// Forward declarations
class Graph;

/** Breadth first search traversal
 *
 * @param g Graph to traverse
 *
 * @return A vector with the node id traversal order
 */
std::vector<NodeID> bfs(Graph &g);
/** Depth first search traversal
 *
 * @param g Graph to traverse
 *
 * @return A vector with the node id traversal order
 */
std::vector<NodeID> dfs(Graph &g);
} // namespace graph
} // namespace arm_compute
#endif /* ARM_COMPUTE_GRAPH_ALGORITHM_TOPOLOGICAL_SORT_H */