Searched refs:closed_plus (Results 1 – 15 of 15) sorted by relevance
| /third_party/boost/boost/graph/ |
| D | relax.hpp | 23 template < class T > struct closed_plus struct
27 closed_plus() : inf((std::numeric_limits< T >::max)()) {} in closed_plus() argument
28 closed_plus(T inf) : inf(inf) {} in closed_plus() function
128 typedef closed_plus< D > Combine; in relax()
|
| D | astar_search.hpp | 468 closed_plus< D > default_combine(inf); in astar_search()
470 boost::graph::keywords::tag::distance_combine, closed_plus< D >& >::type in astar_search()
526 closed_plus< D > default_combine(inf); in astar_search_tree()
528 boost::graph::keywords::tag::distance_combine, closed_plus< D >& >::type in astar_search_tree()
590 closed_plus< D > default_combine(inf); in astar_search_no_init()
592 boost::graph::keywords::tag::distance_combine, closed_plus< D >& >::type in astar_search_no_init()
645 closed_plus< D > default_combine(inf); in astar_search_no_init_tree()
647 boost::graph::keywords::tag::distance_combine, closed_plus< D >& >::type in astar_search_no_init_tree()
|
| D | bellman_ford_shortest_paths.hpp | 161 get_param(params, distance_combine_t()), closed_plus< D >()), in bellman_dispatch2()
178 get_param(params, distance_combine_t()), closed_plus< D >()), in bellman_dispatch2()
|
| D | johnson_all_pairs_shortest.hpp | 151 closed_plus< WT >(), (std::numeric_limits< WT >::max)(), zero); in johnson_all_pairs_shortest_paths()
168 get_param(params, distance_combine_t()), closed_plus< WT >()), in johnson_dispatch()
|
| D | floyd_warshall_shortest.hpp | 158 closed_plus< WM >(inf)), in floyd_warshall_init_dispatch()
176 closed_plus< WM >(inf)), in floyd_warshall_noninit_dispatch()
|
| D | dag_shortest_paths.hpp | 95 get_param(params, distance_combine_t()), closed_plus< D >(inf)), in dag_sp_dispatch2()
|
| D | betweenness_centrality.hpp | 92 closed_plus< distance_type > combine; in edge_not_relaxed()
|
| /third_party/boost/libs/graph/example/ |
| D | dag_shortest_paths.cpp | 63 closed_plus< int > combine; in main()
|
| D | min_max_paths.cpp | 82 std::greater< int >(), closed_plus< int >(), in main()
|
| D | ospf-example.cpp | 77 indexmap, std::less< int >(), closed_plus< int >(), in main()
|
| D | bellman-example.cpp | 91 &distance[0], closed_plus< int >(), std::less< int >(), in main()
|
| /third_party/boost/libs/graph/test/ |
| D | bellman-test.cpp | 67 closed_plus< int >(), std::less< int >(), default_bellman_visitor()); in main()
|
| D | dijkstra_heap_performance.cpp | 148 std::less< double >(), boost::closed_plus< double >(), in main()
|
| /third_party/boost/boost/graph/distributed/ |
| D | eager_dijkstra_shortest_paths.hpp | 412 closed_plus<distance_type>(), in eager_dijkstra_shortest_paths()
|
| D | crauser_et_al_shortest_paths.hpp | 629 closed_plus<distance_type>(), in crauser_et_al_shortest_paths()
|