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

- 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
• v_min_node : pgrouting::bidirectional::Pgr_bidirectional< G >
• v_pos : PARENT_PATH , pgrouting::trsp::Pgr_trspHandler::Predecessor
• v_source : pgrouting::bidirectional::Pgr_bidirectional< G > , pgrouting::yen::Pgr_ksp< G >
• v_target : pgrouting::bidirectional::Pgr_bidirectional< G > , pgrouting::yen::Pgr_ksp< G >
• V_to_id : pgrouting::flow::PgrCardinalityGraph< G > , pgrouting::graph::PgrFlowGraph
• Vehicle() : pgrouting::vrp::Vehicle
• vehicle_id : General_vehicle_orders_t
• Vehicle_node() : pgrouting::vrp::Vehicle_node
• Vehicle_pickDeliver() : pgrouting::vrp::Vehicle_pickDeliver
• vehicle_seq : General_vehicle_orders_t
• Vertex : pgrouting::functions::Pgr_LTDTree< G >
• vertex_id : path_element , pgrouting::Line_vertex , Point_on_edge_t
• vertex_index : pgrouting::Basic_vertex
• vertexVisited : pgrouting::graph::PgrDirectedChPPGraph
• vertices : pgrouting::graph::PgrDirectedChPPGraph
• vertices_map : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• vertices_size_type : pgrouting::functions::Pgr_sequentialVertexColoring< G > , pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• vertIndex : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• via : restrict_struct , Restriction_t
• via_path : restrict_columns
• via_size : Restriction_t
• vid : pgr_bipartite_rt , pgr_ltdtree_rt , transitiveClosure_rt
• vToId : pgrouting::graph::PgrCostFlowGraph
• VToVecid : pgrouting::graph::PgrDirectedChPPGraph