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

- m -

• m_adjacency : pgrouting::trsp::Pgr_trspHandler
• m_adjacent_triangles : pgrouting::alphashape::Pgr_alphaShape
• m_all : pgrouting::trsp::Rule
• m_all_orders : pgrouting::vrp::Initial_solution
• m_arrival_time : pgrouting::vrp::Vehicle_node
• m_assigned : pgrouting::vrp::Initial_solution
• m_bIsGraphConstructed : GraphDefinition
• m_bIsLeadingRestrictedEdge : GraphEdgeInfo
• m_bIsturnRestrictOn : GraphDefinition
• m_capacity : pgrouting::vrp::Vehicle
• m_cargo : pgrouting::vrp::Vehicle_node
• m_closes : pgrouting::vrp::Tw_node
• m_color : pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init
• m_colors : pgrouting::visitors::Dfs_visitor< V, E, G >
• m_compatibleI : pgrouting::vrp::Order
• m_compatibleJ : pgrouting::vrp::Order
• m_components : pgrouting::functions::Pgr_mst< G >
• m_contracted_vertices : pgrouting::CH_edge , pgrouting::CH_vertex
• m_cost : pgrouting::graph::PgrDirectedChPPGraph , pgrouting::trsp::Rule
• m_cost_matrix : pgrouting::vrp::Pgr_pickDeliver
• m_cvTot : pgrouting::vrp::Vehicle_node
• m_data : pgrouting::visitors::Dfs_visitor< V, E, G > , pgrouting::visitors::Dfs_visitor_with_root< V, E > , pgrouting::visitors::Edges_order_bfs_visitor< E > , pgrouting::visitors::Edges_order_dfs_visitor< E > , pgrouting::visitors::Prim_dijkstra_visitor< V >
• m_dCost : GraphDefinition , GraphEdgeInfo , pgrouting::trsp::Pgr_trspHandler
• m_delivery : pgrouting::vrp::Order
• m_delta_time : pgrouting::vrp::Vehicle_node
• m_demand : pgrouting::vrp::Tw_node
• m_dEndPart : GraphDefinition
• m_departure_time : pgrouting::vrp::Vehicle_node
• m_depth : pgrouting::visitors::Dfs_visitor< V, E, G >
• m_dest_id : pgrouting::trsp::Rule
• m_directed : pgrouting::Pg_points_graph
• m_dist : pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor , pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init
• m_distance : pgrouting::functions::Pgr_mst< G >
• m_distance_goal : pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor , pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init
• m_dReverseCost : GraphEdgeInfo
• m_driving_side : pgrouting::Pg_points_graph
• m_dStartpart : GraphDefinition
• m_edge : pgrouting::trsp::EdgeInfo
• m_edge_costs : pgrouting::graph::Pgr_lineGraphFull< G, T_V, T_E >
• m_edgeIndex : pgrouting::trsp::EdgeInfo
• m_edges : pgrouting::graph::Pgr_lineGraph< G, T_V, T_E > , pgrouting::trsp::Pgr_trspHandler
• m_edges_of_points : pgrouting::Pg_points_graph
• m_end : pgrouting::yen::Pgr_ksp< G >
• m_end_id : Path
• m_end_vertex : pgrouting::trsp::Pgr_trspHandler
• m_endConnectedEdge : pgrouting::trsp::EdgeInfo
• m_factor : pgrouting::algorithms::Pgr_astar< G >::distance_heuristic , pgrouting::bidirectional::Pgr_bdAstar< G > , pgrouting::vrp::Vehicle
• m_feasable_orders : pgrouting::vrp::Vehicle_pickDeliver
• m_forbiddenVertices : pgrouting::contraction::Pgr_linear< G >
• m_found_goals : pgrouting::Pgr_dijkstra< G >::dijkstra_many_goal_visitor
• m_g : pgrouting::algorithms::Pgr_astar< G >::distance_heuristic
• m_get_component : pgrouting::functions::Pgr_mst< G >
• m_goal : Pgr_dag< G >::dijkstra_one_goal_visitor , pgrouting::algorithms::Pgr_astar< G >::astar_one_goal_visitor , pgrouting::visitors::dijkstra_one_goal_visitor< V >
• m_goals : Pgr_dag< G >::dijkstra_many_goal_visitor , pgrouting::algorithms::Pgr_astar< G >::astar_many_goals_visitor , pgrouting::algorithms::Pgr_astar< G >::distance_heuristic , pgrouting::Pgr_dijkstra< G >::dijkstra_many_goal_visitor
• m_graph : pgrouting::visitors::Dfs_visitor< V, E, G >
• m_gType : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• m_Heap : pgrouting::yen::Pgr_ksp< G >
• m_heap_paths : pgrouting::yen::Pgr_ksp< G > , pgrouting::yen::Pgr_turnRestrictedPath< G >
• m_heuristic : pgrouting::algorithms::Pgr_astar< G >::distance_heuristic , pgrouting::bidirectional::Pgr_bdAstar< G >
• m_id : pgrouting::Identifier
• m_ids : Identifiers< T >
• m_idx : pgrouting::Identifier
• m_initial_id : pgrouting::vrp::Pgr_pickDeliver
• m_K : pgrouting::yen::Pgr_ksp< G >
• m_lEdgeID : GraphEdgeInfo
• m_lEdgeIndex : GraphEdgeInfo
• m_lEndEdgeId : GraphDefinition
• m_lEndNode : GraphEdgeInfo
• m_linearVertices : pgrouting::contraction::Pgr_linear< G >
• m_log : pgrouting::bidirectional::Pgr_bidirectional< G >
• m_lStartEdgeId : GraphDefinition
• m_lStartNode : GraphEdgeInfo
• m_mapEdgeId2Index : GraphDefinition , pgrouting::trsp::Pgr_trspHandler
• m_mapNodeId2Edge : GraphDefinition
• m_max_cycles : pgrouting::vrp::Pgr_pickDeliver
• m_max_depth : pgrouting::functions::Pgr_mst< G > , pgrouting::visitors::Dfs_visitor< V, E, G >
• m_min_id : pgrouting::trsp::Pgr_trspHandler
• m_n_goals : Pgr_dag< G >::dijkstra_many_goal_visitor , pgrouting::Pgr_dijkstra< G >::dijkstra_many_goal_visitor
• m_new_edges : pgrouting::Pg_points_graph
• m_nodes : pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor , pgrouting::vrp::Pgr_pickDeliver
• m_num_edges : pgrouting::graph::Pgr_lineGraphFull< G, T_V, T_E >
• m_num_examined : pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init
• m_o_points : pgrouting::Pg_points_graph
• m_opens : pgrouting::vrp::Tw_node
• m_order : pgrouting::vrp::Tw_node
• m_orders : pgrouting::vrp::PD_Orders , pgrouting::vrp::Pgr_pickDeliver , pgrouting::vrp::Vehicle_pickDeliver
• m_orders_in_vehicle : pgrouting::vrp::Vehicle_pickDeliver
• m_parent : pgrouting::trsp::Pgr_trspHandler
• m_path : pgrouting::trsp::Pgr_trspHandler , pgrouting::vrp::Vehicle
• m_pickup : pgrouting::vrp::Order
• m_points : pgrouting::Pg_points_graph
• m_precedencelist : pgrouting::trsp::Rule
• m_predecessors : pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init
• m_restrictions : pgrouting::yen::Pgr_turnRestrictedPath< G > , pgrouting::yen::Pgr_turnRestrictedPath< G >::Myvisitor
• m_ResultSet : pgrouting::yen::Pgr_ksp< G >
• m_roots : pgrouting::functions::Pgr_mst< G > , pgrouting::visitors::Dfs_visitor< V, E, G > , pgrouting::visitors::Dfs_visitor_with_root< V, E >
• m_ruleTable : GraphDefinition , pgrouting::trsp::Pgr_trspHandler
• m_sDirection : GraphEdgeInfo
• m_service_time : pgrouting::vrp::Tw_node
• m_solutions : pgrouting::yen::Pgr_turnRestrictedPath< G > , pgrouting::yen::Pgr_turnRestrictedPath< G >::Myvisitor
• m_spanning_tree : pgrouting::functions::Pgr_mst< G >
• m_speed : pgrouting::vrp::Vehicle
• m_start : pgrouting::yen::Pgr_ksp< G >
• m_start_id : Path
• m_start_vertex : pgrouting::trsp::Pgr_trspHandler
• m_startConnectedEdge : pgrouting::trsp::EdgeInfo
• m_stop_on_first : pgrouting::yen::Pgr_turnRestrictedPath< G > , pgrouting::yen::Pgr_turnRestrictedPath< G >::Myvisitor
• m_strict : pgrouting::yen::Pgr_turnRestrictedPath< G >
• m_suffix : pgrouting::functions::Pgr_mst< G >
• m_swaps : pgrouting::vrp::Swap_bk
• m_tot_cost : Path
• m_tot_service_time : pgrouting::vrp::Vehicle_node
• m_tot_travel_time : pgrouting::vrp::Vehicle_node
• m_tot_wait_time : pgrouting::vrp::Vehicle_node
• m_transformation_map : pgrouting::graph::Pgr_lineGraphFull< G, T_V, T_E >
• m_travel_time : pgrouting::vrp::Vehicle_node
• m_tree_id : pgrouting::functions::Pgr_mst< G >
• m_trucks : pgrouting::vrp::Fleet , pgrouting::vrp::Pgr_pickDeliver
• m_twvTot : pgrouting::vrp::Vehicle_node
• m_type : pgrouting::vrp::Tw_node
• m_un_used : pgrouting::vrp::Fleet
• m_unassigned : pgrouting::functions::Pgr_prim< G > , pgrouting::vrp::Initial_solution
• m_used : pgrouting::vrp::Fleet
• m_vecEdgeVector : GraphDefinition
• m_vecEndConnedtedEdge : GraphEdgeInfo
• m_vecPath : GraphDefinition
• m_vecRestrictedEdge : GraphEdgeInfo
• m_vecStartConnectedEdge : GraphEdgeInfo
• m_vertex_map : pgrouting::graph::Pgr_lineGraphFull< G, T_V, T_E >
• m_vis : pgrouting::yen::Pgr_ksp< G >
• m_wait_time : pgrouting::vrp::Vehicle_node
• make_matrix() : Pgr_allpairs< G >
• make_result() : Pgr_allpairs< G >
• make_triangles() : pgrouting::alphashape::Pgr_alphaShape
• makeConnected() : pgrouting::functions::Pgr_makeConnected< G >
• mapIndex : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• max_cycles() : pgrouting::vrp::Pgr_pickDeliver
• max_edge_id : GraphDefinition
• max_node_id : GraphDefinition
• maximum_cardinality_matching() : pgrouting::flow::PgrCardinalityGraph< G >
• MinCostMaxFlow() : pgrouting::graph::PgrCostFlowGraph
• mincut : pgr_stoerWagner_t
• move_order() : pgrouting::vrp::Optimize
• move_reduce_cost() : pgrouting::vrp::Optimize
• msg() : pgrouting::vrp::Dnode , pgrouting::vrp::Fleet , pgrouting::vrp::PD_Orders , pgrouting::vrp::Pgr_pickDeliver , pgrouting::vrp::Solution , pgrouting::vrp::Vehicle
• mst() : pgrouting::functions::Pgr_mst< G >
• mstBFS() : pgrouting::functions::Pgr_mst< G >
• mstDD() : pgrouting::functions::Pgr_mst< G >
• mstDFS() : pgrouting::functions::Pgr_mst< G >
• my_dijkstra1() : GraphDefinition
• my_dijkstra2() : GraphDefinition
• my_dijkstra3() : GraphDefinition
• Myvisitor() : pgrouting::yen::Pgr_turnRestrictedPath< G >::Myvisitor