topological_sort.h
Go to the documentation of this file.
1 /*
2  * This file is part of the alglib project.
3  *
4  * (c) Divyanshu Kakwani <divkakwani@gmail.com>
5  *
6  * For the full copyright and license information, please view the LICENSE file
7  * that was distributed with this source code.
8  */
9 
10 #pragma once
11 
12 #include <alglib/graph/dfs.h>
13 
14 namespace alglib {
15 namespace graph {
16 
17 
18 template<typename GraphType, typename OutputIter>
19 OutputIter topological_order(const GraphType& G, OutputIter dest) {
20  return postorder_dfs(G, dest);
21 }
22 
23 } // end of graph namespace
24 } // end of alglib namespace
Definition: bimap.h:17
OutputIter postorder_dfs(const GraphType &G, const typename GraphType::vertex_type start, OutputIter dest)
Definition: dfs.h:95
OutputIter topological_order(const GraphType &G, OutputIter dest)
Definition: topological_sort.h:19