| /dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
| H A D | transitive_reduction.hpp | 56 std::vector<Vertex> topo_order; in transitive_reduction() local
57 topological_sort(g, std::back_inserter(topo_order)); in transitive_reduction()
65 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
67 for(; it != topo_order.rend(); ++it,++n ) { in transitive_reduction()
75 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
76 for( ; it != topo_order.rend(); ++it ) { in transitive_reduction()
82 it = topo_order.begin(), in transitive_reduction()
83 end = topo_order.end(); in transitive_reduction()
102 rit = topo_order.rbegin(), in transitive_reduction()
103 rend = topo_order.rend(); in transitive_reduction()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/ |
| H A D | transitive_reduction.hpp | 52 std::vector< Vertex > topo_order; in transitive_reduction() local
53 topological_sort(g, std::back_inserter(topo_order)); in transitive_reduction()
62 = topo_order.rbegin(); in transitive_reduction()
64 for (; it != topo_order.rend(); ++it, ++n) in transitive_reduction()
74 = topo_order.rbegin(); in transitive_reduction()
75 for (; it != topo_order.rend(); ++it) in transitive_reduction()
81 typename std::vector< Vertex >::iterator it = topo_order.begin(), in transitive_reduction()
82 end = topo_order.end(); in transitive_reduction()
103 = topo_order.rbegin(), in transitive_reduction()
104 rend = topo_order.rend(); in transitive_reduction()
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/ |
| H A D | transitive_reduction.hpp | 56 std::vector<Vertex> topo_order; in transitive_reduction() local
57 topological_sort(g, std::back_inserter(topo_order)); in transitive_reduction()
65 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
67 for(; it != topo_order.rend(); ++it,++n ) { in transitive_reduction()
75 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
76 for( ; it != topo_order.rend(); ++it ) { in transitive_reduction()
82 it = topo_order.begin(), in transitive_reduction()
83 end = topo_order.end(); in transitive_reduction()
102 rit = topo_order.rbegin(), in transitive_reduction()
103 rend = topo_order.rend(); in transitive_reduction()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/ |
| H A D | transitive_reduction.hpp | 56 std::vector<Vertex> topo_order; in transitive_reduction() local
57 topological_sort(g, std::back_inserter(topo_order)); in transitive_reduction()
65 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
67 for(; it != topo_order.rend(); ++it,++n ) { in transitive_reduction()
75 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
76 for( ; it != topo_order.rend(); ++it ) { in transitive_reduction()
82 it = topo_order.begin(), in transitive_reduction()
83 end = topo_order.end(); in transitive_reduction()
102 rit = topo_order.rbegin(), in transitive_reduction()
103 rend = topo_order.rend(); in transitive_reduction()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/ |
| H A D | transitive_reduction.hpp | 52 std::vector< Vertex > topo_order; in transitive_reduction() local
53 topological_sort(g, std::back_inserter(topo_order)); in transitive_reduction()
62 = topo_order.rbegin(); in transitive_reduction()
64 for (; it != topo_order.rend(); ++it, ++n) in transitive_reduction()
74 = topo_order.rbegin(); in transitive_reduction()
75 for (; it != topo_order.rend(); ++it) in transitive_reduction()
81 typename std::vector< Vertex >::iterator it = topo_order.begin(), in transitive_reduction()
82 end = topo_order.end(); in transitive_reduction()
103 = topo_order.rbegin(), in transitive_reduction()
104 rend = topo_order.rend(); in transitive_reduction()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/ |
| H A D | transitive_reduction.hpp | 52 std::vector< Vertex > topo_order; in transitive_reduction() local
53 topological_sort(g, std::back_inserter(topo_order)); in transitive_reduction()
62 = topo_order.rbegin(); in transitive_reduction()
64 for (; it != topo_order.rend(); ++it, ++n) in transitive_reduction()
74 = topo_order.rbegin(); in transitive_reduction()
75 for (; it != topo_order.rend(); ++it) in transitive_reduction()
81 typename std::vector< Vertex >::iterator it = topo_order.begin(), in transitive_reduction()
82 end = topo_order.end(); in transitive_reduction()
103 = topo_order.rbegin(), in transitive_reduction()
104 rend = topo_order.rend(); in transitive_reduction()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/ |
| H A D | transitive_reduction.hpp | 56 std::vector<Vertex> topo_order; in transitive_reduction() local
57 topological_sort(g, std::back_inserter(topo_order)); in transitive_reduction()
65 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
67 for(; it != topo_order.rend(); ++it,++n ) { in transitive_reduction()
75 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
76 for( ; it != topo_order.rend(); ++it ) { in transitive_reduction()
82 it = topo_order.begin(), in transitive_reduction()
83 end = topo_order.end(); in transitive_reduction()
102 rit = topo_order.rbegin(), in transitive_reduction()
103 rend = topo_order.rend(); in transitive_reduction()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/ |
| H A D | transitive_reduction.hpp | 56 std::vector<Vertex> topo_order; in transitive_reduction() local
57 topological_sort(g, std::back_inserter(topo_order)); in transitive_reduction()
65 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
67 for(; it != topo_order.rend(); ++it,++n ) { in transitive_reduction()
75 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
76 for( ; it != topo_order.rend(); ++it ) { in transitive_reduction()
82 it = topo_order.begin(), in transitive_reduction()
83 end = topo_order.end(); in transitive_reduction()
102 rit = topo_order.rbegin(), in transitive_reduction()
103 rend = topo_order.rend(); in transitive_reduction()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/ |
| H A D | transitive_reduction.hpp | 56 std::vector<Vertex> topo_order; in transitive_reduction() local
57 topological_sort(g, std::back_inserter(topo_order)); in transitive_reduction()
65 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
67 for(; it != topo_order.rend(); ++it,++n ) { in transitive_reduction()
75 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
76 for( ; it != topo_order.rend(); ++it ) { in transitive_reduction()
82 it = topo_order.begin(), in transitive_reduction()
83 end = topo_order.end(); in transitive_reduction()
102 rit = topo_order.rbegin(), in transitive_reduction()
103 rend = topo_order.rend(); in transitive_reduction()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/graph/ |
| H A D | transitive_reduction.hpp | 56 std::vector<Vertex> topo_order; in transitive_reduction() local
57 topological_sort(g, std::back_inserter(topo_order)); in transitive_reduction()
65 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
67 for(; it != topo_order.rend(); ++it,++n ) { in transitive_reduction()
75 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
76 for( ; it != topo_order.rend(); ++it ) { in transitive_reduction()
82 it = topo_order.begin(), in transitive_reduction()
83 end = topo_order.end(); in transitive_reduction()
102 rit = topo_order.rbegin(), in transitive_reduction()
103 rend = topo_order.rend(); in transitive_reduction()
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/ |
| H A D | transitive_reduction.hpp | 56 std::vector<Vertex> topo_order; in transitive_reduction() local
57 topological_sort(g, std::back_inserter(topo_order)); in transitive_reduction()
65 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
67 for(; it != topo_order.rend(); ++it,++n ) { in transitive_reduction()
75 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
76 for( ; it != topo_order.rend(); ++it ) { in transitive_reduction()
82 it = topo_order.begin(), in transitive_reduction()
83 end = topo_order.end(); in transitive_reduction()
102 rit = topo_order.rbegin(), in transitive_reduction()
103 rend = topo_order.rend(); in transitive_reduction()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/ |
| H A D | transitive_reduction.hpp | 56 std::vector<Vertex> topo_order; in transitive_reduction() local
57 topological_sort(g, std::back_inserter(topo_order)); in transitive_reduction()
65 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
67 for(; it != topo_order.rend(); ++it,++n ) { in transitive_reduction()
75 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
76 for( ; it != topo_order.rend(); ++it ) { in transitive_reduction()
82 it = topo_order.begin(), in transitive_reduction()
83 end = topo_order.end(); in transitive_reduction()
102 rit = topo_order.rbegin(), in transitive_reduction()
103 rend = topo_order.rend(); in transitive_reduction()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/ |
| H A D | transitive_reduction.hpp | 56 std::vector<Vertex> topo_order; in transitive_reduction() local
57 topological_sort(g, std::back_inserter(topo_order)); in transitive_reduction()
65 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
67 for(; it != topo_order.rend(); ++it,++n ) { in transitive_reduction()
75 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
76 for( ; it != topo_order.rend(); ++it ) { in transitive_reduction()
82 it = topo_order.begin(), in transitive_reduction()
83 end = topo_order.end(); in transitive_reduction()
102 rit = topo_order.rbegin(), in transitive_reduction()
103 rend = topo_order.rend(); in transitive_reduction()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/graph/ |
| H A D | transitive_reduction.hpp | 56 std::vector<Vertex> topo_order; in transitive_reduction() local
57 topological_sort(g, std::back_inserter(topo_order)); in transitive_reduction()
65 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
67 for(; it != topo_order.rend(); ++it,++n ) { in transitive_reduction()
75 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
76 for( ; it != topo_order.rend(); ++it ) { in transitive_reduction()
82 it = topo_order.begin(), in transitive_reduction()
83 end = topo_order.end(); in transitive_reduction()
102 rit = topo_order.rbegin(), in transitive_reduction()
103 rend = topo_order.rend(); in transitive_reduction()
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/graph/ |
| H A D | transitive_reduction.hpp | 56 std::vector<Vertex> topo_order;
57 topological_sort(g, std::back_inserter(topo_order));
65 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin();
67 for(; it != topo_order.rend(); ++it,++n ) {
75 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin();
76 for( ; it != topo_order.rend(); ++it ) {
82 it = topo_order.begin(),
83 end = topo_order.end();
102 rit = topo_order.rbegin(),
103 rend = topo_order.rend();
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/graph/ |
| H A D | transitive_reduction.hpp | 56 std::vector<Vertex> topo_order; in transitive_reduction() local
57 topological_sort(g, std::back_inserter(topo_order)); in transitive_reduction()
65 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
67 for(; it != topo_order.rend(); ++it,++n ) { in transitive_reduction()
75 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
76 for( ; it != topo_order.rend(); ++it ) { in transitive_reduction()
82 it = topo_order.begin(), in transitive_reduction()
83 end = topo_order.end(); in transitive_reduction()
102 rit = topo_order.rbegin(), in transitive_reduction()
103 rend = topo_order.rend(); in transitive_reduction()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/graph/ |
| H A D | transitive_reduction.hpp | 52 std::vector< Vertex > topo_order; in transitive_reduction() local
53 topological_sort(g, std::back_inserter(topo_order)); in transitive_reduction()
62 = topo_order.rbegin(); in transitive_reduction()
64 for (; it != topo_order.rend(); ++it, ++n) in transitive_reduction()
74 = topo_order.rbegin(); in transitive_reduction()
75 for (; it != topo_order.rend(); ++it) in transitive_reduction()
81 typename std::vector< Vertex >::iterator it = topo_order.begin(), in transitive_reduction()
82 end = topo_order.end(); in transitive_reduction()
103 = topo_order.rbegin(), in transitive_reduction()
104 rend = topo_order.rend(); in transitive_reduction()
|
| /dports/biology/cufflinks/cufflinks-2.2.1-89-gdc3b0cb/src/ |
| H A D | transitive_reduction.h | 56 std::vector<Vertex> topo_order; in transitive_reduction() local
57 topological_sort(g, std::back_inserter(topo_order)); in transitive_reduction()
65 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
67 for(; it != topo_order.rend(); ++it,++n ) { in transitive_reduction()
75 typename std::vector<Vertex>::reverse_iterator it = topo_order.rbegin(); in transitive_reduction()
76 for( ; it != topo_order.rend(); ++it ) { in transitive_reduction()
82 it = topo_order.begin(), in transitive_reduction()
83 end = topo_order.end(); in transitive_reduction()
101 typename std::vector<Vertex>::reverse_iterator rit = topo_order.rbegin(); in transitive_reduction()
102 typename std::vector<Vertex>::reverse_iterator rend = topo_order.rend(); in transitive_reduction()
|
| /dports/devel/boost-docs/boost_1_72_0/libs/graph/example/ |
| H A D | topo-sort-with-leda.cpp | 41 std::vector < vertex_t > topo_order; in main() local
44 topological_sort(leda_g, std::back_inserter(topo_order), in main()
47 std::reverse(topo_order.begin(), topo_order.end()); in main()
49 for (std::vector < vertex_t >::iterator i = topo_order.begin(); in main()
50 i != topo_order.end(); ++i, ++n) in main()
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/graph/example/ |
| H A D | topo-sort-with-leda.cpp | 41 std::vector < vertex_t > topo_order; in main() local
44 topological_sort(leda_g, std::back_inserter(topo_order), in main()
47 std::reverse(topo_order.begin(), topo_order.end()); in main()
49 for (std::vector < vertex_t >::iterator i = topo_order.begin(); in main()
50 i != topo_order.end(); ++i, ++n) in main()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/example/ |
| H A D | topo-sort-with-leda.cpp | 41 std::vector < vertex_t > topo_order; in main() local
44 topological_sort(leda_g, std::back_inserter(topo_order), in main()
47 std::reverse(topo_order.begin(), topo_order.end()); in main()
49 for (std::vector < vertex_t >::iterator i = topo_order.begin(); in main()
50 i != topo_order.end(); ++i, ++n) in main()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/example/ |
| H A D | topo-sort-with-leda.cpp | 41 std::vector < vertex_t > topo_order; in main() local
44 topological_sort(leda_g, std::back_inserter(topo_order), in main()
47 std::reverse(topo_order.begin(), topo_order.end()); in main()
49 for (std::vector < vertex_t >::iterator i = topo_order.begin(); in main()
50 i != topo_order.end(); ++i, ++n) in main()
|
| /dports/databases/percona57-server/boost_1_59_0/libs/graph/example/ |
| H A D | topo-sort-with-leda.cpp | 41 std::vector < vertex_t > topo_order; in main() local
44 topological_sort(leda_g, std::back_inserter(topo_order), in main()
47 std::reverse(topo_order.begin(), topo_order.end()); in main()
49 for (std::vector < vertex_t >::iterator i = topo_order.begin(); in main()
50 i != topo_order.end(); ++i, ++n) in main()
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/graph/example/ |
| H A D | topo-sort-with-leda.cpp | 41 std::vector < vertex_t > topo_order; in main() local
44 topological_sort(leda_g, std::back_inserter(topo_order), in main()
47 std::reverse(topo_order.begin(), topo_order.end()); in main()
49 for (std::vector < vertex_t >::iterator i = topo_order.begin(); in main()
50 i != topo_order.end(); ++i, ++n) in main()
|
| /dports/databases/percona57-client/boost_1_59_0/libs/graph/example/ |
| H A D | topo-sort-with-leda.cpp | 41 std::vector < vertex_t > topo_order; in main() local
44 topological_sort(leda_g, std::back_inserter(topo_order), in main()
47 std::reverse(topo_order.begin(), topo_order.end()); in main()
49 for (std::vector < vertex_t >::iterator i = topo_order.begin(); in main()
50 i != topo_order.end(); ++i, ++n) in main()
|