Here is a list of all class members with links to the classes they belong to:

- d -

• dag() : Pgr_dag< G >
• dag_1_to_1() : Pgr_dag< G >
• dag_1_to_many() : Pgr_dag< G >
• data : pgrouting::functions::Pgr_prim< G >
• deadendVertices : pgrouting::contraction::Pgr_deadend< G >
• decrease_truck() : pgrouting::vrp::Optimize
• DEFAULT_EDGE : pgrouting::functions::Pgr_binaryBreadthFirstSearch< G > , pgrouting::functions::Pgr_edwardMoore< G >
• degree_size_type : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• delete_empty_truck() : pgrouting::vrp::Optimize
• deleteall() : GraphDefinition
• deliver_close_t : PickDeliveryOrders_t
• deliver_node_id : PickDeliveryOrders_t
• deliver_open_t : PickDeliveryOrders_t
• deliver_service_t : PickDeliveryOrders_t
• deliver_x : PickDeliveryOrders_t
• deliver_y : PickDeliveryOrders_t
• delivery() : pgrouting::vrp::Order
• delta_time() : pgrouting::vrp::Vehicle_node
• demand() : pgrouting::vrp::Tw_node , PickDeliveryOrders_t
• departure_time() : pgrouting::vrp::Vehicle_node
• departureTime : General_vehicle_orders_t
• depth : pgr_mst_rt
• depthFirstSearch() : pgrouting::functions::Pgr_depthFirstSearch< G >
• depthFirstSearch_single_vertex() : pgrouting::functions::Pgr_depthFirstSearch< G >
• dest_id() : pgrouting::trsp::Rule
• dfs_forest() : pgrouting::functions::Pgr_mst< G >
• dfs_order() : pgrouting::functions::Pgr_mst< G >
• dfs_ordering() : pgrouting::functions::Pgr_mst< G >
• Dfs_visitor() : pgrouting::visitors::Dfs_visitor< V, E, G >
• Dfs_visitor_with_root() : pgrouting::visitors::Dfs_visitor_with_root< V, E >
• difference_type : pgrouting::tsp::Tour , pgrouting::vrp::Vehicle
• dijkstra() : pgrouting::Pgr_dijkstra< G >
• dijkstra_1_to_1() : pgrouting::Pgr_dijkstra< G >
• dijkstra_1_to_distance() : pgrouting::Pgr_dijkstra< G >
• dijkstra_1_to_distance_no_init() : pgrouting::Pgr_dijkstra< G >
• dijkstra_1_to_many() : pgrouting::Pgr_dijkstra< G >
• dijkstra_distance_visitor() : pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor
• dijkstra_distance_visitor_no_init() : pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init
• dijkstra_exploration() : pgrouting::trsp::Pgr_trspHandler
• dijkstra_many_goal_visitor() : Pgr_dag< G >::dijkstra_many_goal_visitor , pgrouting::Pgr_dijkstra< G >::dijkstra_many_goal_visitor
• dijkstra_one_goal_visitor() : Pgr_dag< G >::dijkstra_one_goal_visitor , pgrouting::visitors::dijkstra_one_goal_visitor< V >
• DirectedChPP() : pgrouting::graph::PgrDirectedChPPGraph
• disconnect_edge() : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• disconnect_out_going_edge() : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• disconnect_vertex() : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• discover_vertex() : pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init
• dispatcher() : SignalHandler
• distance() : pgrouting::tsp::Dmatrix , pgrouting::tsp::EuclideanDmatrix , pgrouting::vrp::Dnode
• distance_heuristic() : pgrouting::algorithms::Pgr_astar< G >::distance_heuristic
• distances : Pgr_bellman_ford< G > , Pgr_dag< G > , pgrouting::algorithms::Pgr_astar< G > , pgrouting::functions::Pgr_prim< G > , pgrouting::Pgr_dijkstra< G >
• Dmatrix() : pgrouting::tsp::Dmatrix
• Dmatrix::tourCost : pgrouting::tsp::Tour
• Dnode() : pgrouting::vrp::Dnode , pgrouting::vrp::Pgr_pickDeliver
• do_while_feasable() : pgrouting::vrp::Vehicle_pickDeliver
• do_while_foo() : pgrouting::vrp::Initial_solution
• doContraction() : pgrouting::contraction::Pgr_deadend< G > , pgrouting::contraction::Pgr_linear< G >
• doNextCycle() : pgrouting::yen::Pgr_ksp< G >
• driving_side() : pgrouting::Pg_points_graph
• drivingDistance() : pgrouting::Pgr_dijkstra< G >
• drivingDistance_no_equicost() : pgrouting::Pgr_dijkstra< G >
• drivingDistance_with_equicost() : pgrouting::Pgr_dijkstra< G >
• drop_position_limits() : pgrouting::vrp::Vehicle
• duration() : pgrouting::vrp::Solution , pgrouting::vrp::Vehicle