| /dports/biology/abyss/abyss-2.3.1/Graph/ |
| H A D | ExtendPath.h | 109 OutEdgeIter oei, oei_end; in lookAhead() local
118 oei != oei_end; ++oei) { in lookAhead()
197 oei != oei_end; ++oei) { in trueBranch()
231 oei != oei_end; ++oei) { in trueBranch()
288 oei != oei_end; ++oei) { in trueBranches()
324 OutEdgeIt oei, oei_end; in successor() local
333 for (boost::tie(oei, oei_end) = out_edges(u, g); oei != oei_end; ++oei) { in successor()
479 OutEdgeIter oei, oei_end; in depth() local
505 oei != oei_end; ++oei) { in depth()
555 OutEdgeIter oei, oei_end; in longestBranch() local
[all …]
|
| H A D | BidirectionalBFS.h | 97 typename GTraits::out_edge_iterator oei, oei_end; in bidirectionalBFS() local
117 for (boost::tie(oei, oei_end) = out_edges(u, g); oei != oei_end; ++oei) { in bidirectionalBFS()
|
| H A D | BreadthFirstSearch.h | 115 OEIt oei, oei_end; in breadthFirstSearchImpl() local
150 for (boost::tie(oei, oei_end) = out_edges(u, g); oei != oei_end; ++oei) { in breadthFirstSearchImpl()
|
| /dports/devel/boost-docs/boost_1_72_0/libs/graph/test/ |
| H A D | csr_graph_test.cpp | 301 CSRGraphT::out_edge_iterator oei, oei_end; in graph_test() local
302 for (boost::tie(oei, oei_end) = out_edges(*vi, g2); oei != oei_end; ++oei) { in graph_test()
310 for (boost::tie(oei2, oei_end) = out_edges(*vi, g2); oei2 != oei_end; ++oei2) { in graph_test()
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/graph/test/ |
| H A D | csr_graph_test.cpp | 301 CSRGraphT::out_edge_iterator oei, oei_end; in graph_test() local
302 for (boost::tie(oei, oei_end) = out_edges(*vi, g2); oei != oei_end; ++oei) { in graph_test()
310 for (boost::tie(oei2, oei_end) = out_edges(*vi, g2); oei2 != oei_end; ++oei2) { in graph_test()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/test/ |
| H A D | csr_graph_test.cpp | 302 CSRGraphT::out_edge_iterator oei, oei_end; in graph_test() local
303 for (boost::tie(oei, oei_end) = out_edges(*vi, g2); oei != oei_end; ++oei) { in graph_test()
311 for (boost::tie(oei2, oei_end) = out_edges(*vi, g2); oei2 != oei_end; ++oei2) { in graph_test()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/test/ |
| H A D | csr_graph_test.cpp | 302 CSRGraphT::out_edge_iterator oei, oei_end; in graph_test() local
303 for (boost::tie(oei, oei_end) = out_edges(*vi, g2); oei != oei_end; ++oei) { in graph_test()
311 for (boost::tie(oei2, oei_end) = out_edges(*vi, g2); oei2 != oei_end; ++oei2) { in graph_test()
|
| /dports/databases/percona57-server/boost_1_59_0/libs/graph/test/ |
| H A D | csr_graph_test.cpp | 302 CSRGraphT::out_edge_iterator oei, oei_end; in graph_test() local
303 for (boost::tie(oei, oei_end) = out_edges(*vi, g2); oei != oei_end; ++oei) { in graph_test()
311 for (boost::tie(oei2, oei_end) = out_edges(*vi, g2); oei2 != oei_end; ++oei2) { in graph_test()
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/graph/test/ |
| H A D | csr_graph_test.cpp | 302 CSRGraphT::out_edge_iterator oei, oei_end; in graph_test() local
303 for (boost::tie(oei, oei_end) = out_edges(*vi, g2); oei != oei_end; ++oei) { in graph_test()
311 for (boost::tie(oei2, oei_end) = out_edges(*vi, g2); oei2 != oei_end; ++oei2) { in graph_test()
|
| /dports/databases/percona57-client/boost_1_59_0/libs/graph/test/ |
| H A D | csr_graph_test.cpp | 302 CSRGraphT::out_edge_iterator oei, oei_end; in graph_test() local
303 for (boost::tie(oei, oei_end) = out_edges(*vi, g2); oei != oei_end; ++oei) { in graph_test()
311 for (boost::tie(oei2, oei_end) = out_edges(*vi, g2); oei2 != oei_end; ++oei2) { in graph_test()
|
| /dports/devel/boost-libs/boost_1_72_0/libs/graph/test/ |
| H A D | csr_graph_test.cpp | 301 CSRGraphT::out_edge_iterator oei, oei_end; in graph_test() local
302 for (boost::tie(oei, oei_end) = out_edges(*vi, g2); oei != oei_end; ++oei) { in graph_test()
310 for (boost::tie(oei2, oei_end) = out_edges(*vi, g2); oei2 != oei_end; ++oei2) { in graph_test()
|
| /dports/devel/hyperscan/boost_1_75_0/libs/graph/test/ |
| H A D | csr_graph_test.cpp | 318 CSRGraphT::out_edge_iterator oei, oei_end; in graph_test() local
319 for (boost::tie(oei, oei_end) = out_edges(*vi, g2); oei != oei_end; in graph_test()
330 for (boost::tie(oei2, oei_end) = out_edges(*vi, g2); oei2 != oei_end; in graph_test()
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
| H A D | r_c_shortest_paths.hpp | 372 typename graph_traits<Graph>::out_edge_iterator oei, oei_end; in r_c_shortest_paths_dispatch() local
373 for( boost::tie( oei, oei_end ) = out_edges( cur_vertex, g ); in r_c_shortest_paths_dispatch()
374 oei != oei_end; in r_c_shortest_paths_dispatch()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/graph/ |
| H A D | r_c_shortest_paths.hpp | 398 typename graph_traits< Graph >::out_edge_iterator oei, oei_end; in r_c_shortest_paths_dispatch() local
399 for (boost::tie(oei, oei_end) = out_edges(cur_vertex, g); in r_c_shortest_paths_dispatch()
400 oei != oei_end; ++oei) in r_c_shortest_paths_dispatch()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/ |
| H A D | r_c_shortest_paths.hpp | 398 typename graph_traits< Graph >::out_edge_iterator oei, oei_end; in r_c_shortest_paths_dispatch() local
399 for (boost::tie(oei, oei_end) = out_edges(cur_vertex, g); in r_c_shortest_paths_dispatch()
400 oei != oei_end; ++oei) in r_c_shortest_paths_dispatch()
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/ |
| H A D | r_c_shortest_paths.hpp | 361 typename graph_traits<Graph>::out_edge_iterator oei, oei_end; in r_c_shortest_paths_dispatch() local
362 for( boost::tie( oei, oei_end ) = out_edges( cur_vertex, g ); in r_c_shortest_paths_dispatch()
363 oei != oei_end; in r_c_shortest_paths_dispatch()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/ |
| H A D | r_c_shortest_paths.hpp | 398 typename graph_traits< Graph >::out_edge_iterator oei, oei_end; in r_c_shortest_paths_dispatch() local
399 for (boost::tie(oei, oei_end) = out_edges(cur_vertex, g); in r_c_shortest_paths_dispatch()
400 oei != oei_end; ++oei) in r_c_shortest_paths_dispatch()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/ |
| H A D | r_c_shortest_paths.hpp | 398 typename graph_traits< Graph >::out_edge_iterator oei, oei_end; in r_c_shortest_paths_dispatch() local
399 for (boost::tie(oei, oei_end) = out_edges(cur_vertex, g); in r_c_shortest_paths_dispatch()
400 oei != oei_end; ++oei) in r_c_shortest_paths_dispatch()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/ |
| H A D | r_c_shortest_paths.hpp | 372 typename graph_traits<Graph>::out_edge_iterator oei, oei_end; in r_c_shortest_paths_dispatch() local
373 for( boost::tie( oei, oei_end ) = out_edges( cur_vertex, g ); in r_c_shortest_paths_dispatch()
374 oei != oei_end; in r_c_shortest_paths_dispatch()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/ |
| H A D | r_c_shortest_paths.hpp | 372 typename graph_traits<Graph>::out_edge_iterator oei, oei_end; in r_c_shortest_paths_dispatch() local
373 for( boost::tie( oei, oei_end ) = out_edges( cur_vertex, g ); in r_c_shortest_paths_dispatch()
374 oei != oei_end; in r_c_shortest_paths_dispatch()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/ |
| H A D | r_c_shortest_paths.hpp | 403 typename graph_traits<Graph>::out_edge_iterator oei, oei_end; in r_c_shortest_paths_dispatch() local
404 for( boost::tie( oei, oei_end ) = out_edges( cur_vertex, g ); in r_c_shortest_paths_dispatch()
405 oei != oei_end; in r_c_shortest_paths_dispatch()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/ |
| H A D | r_c_shortest_paths.hpp | 403 typename graph_traits<Graph>::out_edge_iterator oei, oei_end; in r_c_shortest_paths_dispatch() local
404 for( boost::tie( oei, oei_end ) = out_edges( cur_vertex, g ); in r_c_shortest_paths_dispatch()
405 oei != oei_end; in r_c_shortest_paths_dispatch()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/ |
| H A D | r_c_shortest_paths.hpp | 403 typename graph_traits<Graph>::out_edge_iterator oei, oei_end; in r_c_shortest_paths_dispatch() local
404 for( boost::tie( oei, oei_end ) = out_edges( cur_vertex, g ); in r_c_shortest_paths_dispatch()
405 oei != oei_end; in r_c_shortest_paths_dispatch()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/ |
| H A D | r_c_shortest_paths.hpp | 404 typename graph_traits<Graph>::out_edge_iterator oei, oei_end; in r_c_shortest_paths_dispatch() local
405 for( boost::tie( oei, oei_end ) = out_edges( cur_vertex, g ); in r_c_shortest_paths_dispatch()
406 oei != oei_end; in r_c_shortest_paths_dispatch()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/graph/ |
| H A D | r_c_shortest_paths.hpp | 403 typename graph_traits<Graph>::out_edge_iterator oei, oei_end; in r_c_shortest_paths_dispatch() local
404 for( boost::tie( oei, oei_end ) = out_edges( cur_vertex, g ); in r_c_shortest_paths_dispatch()
405 oei != oei_end; in r_c_shortest_paths_dispatch()
|