- o -

• obeys_triangle_inequality() : pgrouting::tsp::Dmatrix , pgrouting::tsp::EuclideanDmatrix
• on_insert_first_solution() : pgrouting::yen::Pgr_ksp< G >::Visitor , pgrouting::yen::Pgr_turnRestrictedPath< G >::Myvisitor
• on_insert_to_heap() : pgrouting::yen::Pgr_ksp< G >::Visitor , pgrouting::yen::Pgr_turnRestrictedPath< G >::Myvisitor
• one_cycle() : pgrouting::contraction::Pgr_contract< G > , pgrouting::contraction::Pgr_linear< G >
• one_to_many_binaryBreadthFirstSearch() : pgrouting::functions::Pgr_binaryBreadthFirstSearch< G >
• one_to_many_edwardMoore() : pgrouting::functions::Pgr_edwardMoore< G >
• one_truck_all_orders() : pgrouting::vrp::Initial_solution
• opens() : pgrouting::vrp::Tw_node
• operator()() : Pgr_allpairs< G >::inf_plus< T > , pgrouting::algorithms::Pgr_astar< G >::distance_heuristic , pgrouting::alphashape::anonymous_namespace{pgr_alphaShape.cpp}::CompareRadius , pgrouting::alphashape::Pgr_alphaShape::EdgesFilter , pgrouting::alphashape::Pgr_alphaShape , pgrouting::compPathsLess , pgrouting::contraction::Pgr_linear< G > , pgrouting::functions::Pgr_mst< G >::InSpanning , pgrouting::Pg_points_graph::pointCompare , pgrouting::vrp::Swap_bk::Compare
• operator*=() : Identifiers< T >
• operator+=() : Identifiers< T >
• operator-=() : Identifiers< T >
• operator<() : pgrouting::vrp::Solution
• operator=() : pgrouting::Basic_vertex , pgrouting::Pgr_messages , pgrouting::vrp::Fleet , pgrouting::vrp::Solution
• operator==() : Identifiers< T > , pgrouting::vrp::Tw_node , pgrouting::XY_vertex
• operator[]() : Path , pgrouting::graph::Pgr_base_graph< G, T_V, T_E > , pgrouting::tsp::Dmatrix , pgrouting::vrp::Fleet , pgrouting::vrp::PD_Orders
• Optimize() : pgrouting::vrp::Optimize
• Order() : pgrouting::vrp::Order
• order() : pgrouting::vrp::Tw_node
• orders() : pgrouting::vrp::Vehicle_pickDeliver
• orders_in_vehicle() : pgrouting::vrp::Vehicle_pickDeliver
• orders_size() : pgrouting::vrp::Vehicle_pickDeliver
• out_degree() : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >