- b -

• B_G : pgrouting::algorithms::Pgr_astar< G > , pgrouting::contraction::Pgr_linear< G > , pgrouting::functions::Pgr_binaryBreadthFirstSearch< G > , pgrouting::functions::Pgr_breadthFirstSearch< G > , pgrouting::functions::Pgr_edwardMoore< G > , pgrouting::functions::Pgr_kruskal< G > , pgrouting::functions::Pgr_mst< G > , pgrouting::functions::Pgr_prim< G > , pgrouting::graph::Pgr_base_graph< G, T_V, T_E >

- c -

• const_iterator : Identifiers< T >
• constiterator : pgrouting::trsp::Rule
• ConstpthIt : Path
• Cost : pgrouting::vrp::Vehicle
• Cost_Vertex_pair : pgrouting::bidirectional::Pgr_bdAstar< G > , pgrouting::bidirectional::Pgr_bdDijkstra< G > , pgrouting::bidirectional::Pgr_bidirectional< G >
• Costs : pgrouting::tsp::Dmatrix

- d -

• degree_size_type : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• difference_type : pgrouting::tsp::Tour , pgrouting::vrp::Vehicle

- e -

• E : Pgr_bellman_ford< G > , Pgr_dag< G > , Pgr_randomSpanningTree< G > , Pgr_stoerWagner< G > , pgrouting::bidirectional::Pgr_bdAstar< G > , pgrouting::bidirectional::Pgr_bdDijkstra< G > , pgrouting::bidirectional::Pgr_bidirectional< G > , pgrouting::contraction::Pgr_deadend< G > , pgrouting::flow::PgrCardinalityGraph< G > , pgrouting::functions::Pgr_binaryBreadthFirstSearch< G > , pgrouting::functions::Pgr_boyerMyrvold< G > , pgrouting::functions::Pgr_breadthFirstSearch< G > , pgrouting::functions::Pgr_depthFirstSearch< G > , pgrouting::functions::Pgr_edwardMoore< G > , pgrouting::functions::Pgr_kruskal< G > , pgrouting::functions::Pgr_makeConnected< G > , pgrouting::functions::Pgr_mst< G > , pgrouting::functions::Pgr_prim< G > , pgrouting::functions::Pgr_sequentialVertexColoring< G > , pgrouting::graph::Pgr_base_graph< G, T_V, T_E > , pgrouting::graph::Pgr_contractionGraph< G > , pgrouting::graph::Pgr_lineGraph< G, T_V, T_E > , pgrouting::graph::Pgr_lineGraphFull< G, T_V, T_E > , pgrouting::graph::PgrCostFlowGraph , pgrouting::graph::PgrFlowGraph , pgrouting::Pgr_dijkstra< G >
• E_i : Pgr_stoerWagner< G > , pgrouting::functions::Pgr_binaryBreadthFirstSearch< G > , pgrouting::functions::Pgr_boyerMyrvold< G > , pgrouting::functions::Pgr_edwardMoore< G > , pgrouting::functions::Pgr_LTDTree< G > , pgrouting::functions::Pgr_makeConnected< G > , pgrouting::functions::Pgr_mst< G > , pgrouting::graph::Pgr_base_graph< G, T_V, T_E > , pgrouting::graph::Pgr_lineGraphFull< G, T_V, T_E >
• E_it : pgrouting::flow::PgrCardinalityGraph< G > , pgrouting::graph::PgrCostFlowGraph , pgrouting::graph::PgrFlowGraph
• edges_size_type : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• EI_i : pgrouting::graph::Pgr_base_graph< G, T_V, T_E > , pgrouting::graph::Pgr_contractionGraph< G > , pgrouting::graph::Pgr_lineGraph< G, T_V, T_E > , pgrouting::graph::Pgr_lineGraphFull< G, T_V, T_E >
• EO_i : pgrouting::functions::Pgr_binaryBreadthFirstSearch< G > , pgrouting::functions::Pgr_edwardMoore< G > , pgrouting::graph::Pgr_base_graph< G, T_V, T_E > , pgrouting::graph::Pgr_contractionGraph< G > , pgrouting::graph::Pgr_lineGraph< G, T_V, T_E > , pgrouting::graph::Pgr_lineGraphFull< G, T_V, T_E >
• Eout_it : pgrouting::graph::PgrFlowGraph

- g -

• G_T_E : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• G_T_V : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• Graph : pgrouting::functions::Pgr_sequentialVertexColoring< G >

- i -

• id_to_V : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• IndexMap : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• iterator : Identifiers< T > , pgrouting::trsp::Rule , pgrouting::vrp::Fleet

- l -

• LI : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >

- o -

• o_const_iterator : pgrouting::vrp::PD_Orders
• o_iterator : pgrouting::vrp::PD_Orders
• Orders : pgrouting::vrp::PD_Orders

- p -

• PDP : pgrouting::trsp::Pgr_trspHandler
• POS : pgrouting::vrp::Vehicle
• Priority_queue : pgrouting::bidirectional::Pgr_bidirectional< G >
• pSet : pgrouting::yen::Pgr_ksp< G > , pgrouting::yen::Pgr_turnRestrictedPath< G >
• pthIt : Path

- s -

• Swaps_queue : pgrouting::vrp::Swap_bk

- v -

• V : Pgr_bellman_ford< G > , Pgr_dag< G > , Pgr_randomSpanningTree< G > , Pgr_stoerWagner< G > , Pgr_topologicalSort< G > , Pgr_transitiveClosure< G > , pgrouting::algorithms::Pgr_astar< G > , pgrouting::bidirectional::Pgr_bdAstar< G > , pgrouting::bidirectional::Pgr_bdDijkstra< G > , pgrouting::bidirectional::Pgr_bidirectional< G > , pgrouting::contraction::Pgr_contract< G > , pgrouting::contraction::Pgr_deadend< G > , pgrouting::contraction::Pgr_linear< G > , pgrouting::flow::PgrCardinalityGraph< G > , pgrouting::functions::Pgr_binaryBreadthFirstSearch< G > , pgrouting::functions::Pgr_boyerMyrvold< G > , pgrouting::functions::Pgr_breadthFirstSearch< G > , pgrouting::functions::Pgr_depthFirstSearch< G > , pgrouting::functions::Pgr_edwardMoore< G > , pgrouting::functions::Pgr_kruskal< G > , pgrouting::functions::Pgr_makeConnected< G > , pgrouting::functions::Pgr_mst< G > , pgrouting::functions::Pgr_prim< G > , pgrouting::functions::Pgr_sequentialVertexColoring< G > , pgrouting::graph::Pgr_base_graph< G, T_V, T_E > , pgrouting::graph::Pgr_contractionGraph< G > , pgrouting::graph::Pgr_lineGraph< G, T_V, T_E > , pgrouting::graph::Pgr_lineGraphFull< G, T_V, T_E > , pgrouting::graph::PgrCostFlowGraph , pgrouting::graph::PgrFlowGraph , pgrouting::Pgr_dijkstra< G > , pgrouting::yen::Pgr_ksp< G >
• V_i : pgrouting::contraction::Pgr_linear< G > , pgrouting::functions::Pgr_Bipartite< G > , pgrouting::functions::Pgr_LTDTree< G > , pgrouting::graph::Pgr_base_graph< G, T_V, T_E > , pgrouting::graph::Pgr_lineGraph< G, T_V, T_E > , pgrouting::graph::Pgr_lineGraphFull< G, T_V, T_E >
• V_it : pgrouting::flow::PgrCardinalityGraph< G > , pgrouting::graph::PgrCostFlowGraph , pgrouting::graph::PgrFlowGraph
• Vertex : pgrouting::functions::Pgr_LTDTree< G >
• vertices_size_type : pgrouting::functions::Pgr_sequentialVertexColoring< G > , pgrouting::graph::Pgr_base_graph< G, T_V, T_E >