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

- c -

• C_EDGE : pgrouting::trsp::Pgr_trspHandler
• calculate_component() : pgrouting::functions::Pgr_mst< G >
• calculateVertices() : pgrouting::contraction::Pgr_deadend< G > , pgrouting::contraction::Pgr_linear< G >
• cant_v : Vehicle_t
• capacity : pgr_costFlow_t , pgrouting::graph::PgrCostFlowGraph , pgrouting::graph::PgrFlowGraph , pgrouting::vrp::Vehicle , Vehicle_t
• cargo : General_vehicle_orders_t , pgrouting::vrp::Vehicle_node
• CH_edge() : pgrouting::CH_edge
• CH_vertex() : pgrouting::CH_vertex
• check_points() : pgrouting::Pg_points_graph
• cities : pgrouting::tsp::Tour
• clean_log() : pgrouting::bidirectional::Pgr_bidirectional< G >
• clear() : Identifiers< T > , Path , Pgr_bellman_ford< G > , Pgr_dag< G > , pgrouting::algorithms::Pgr_astar< G > , pgrouting::alphashape::Pgr_alphaShape::EdgesFilter , pgrouting::bidirectional::Pgr_bidirectional< G > , pgrouting::functions::Pgr_mst< G > , pgrouting::functions::Pgr_mst< G >::InSpanning , pgrouting::functions::Pgr_prim< G > , pgrouting::Pgr_dijkstra< G > , pgrouting::Pgr_messages , pgrouting::trsp::Pgr_trspHandler , pgrouting::yen::Pgr_ksp< G > , pgrouting::yen::Pgr_turnRestrictedPath< G >
• clear_contracted_vertices() : pgrouting::CH_edge , pgrouting::CH_vertex
• closes() : pgrouting::vrp::Tw_node
• collapse_paths : Path
• colNumber : Column_info_t
• color : pgr_bipartite_rt , pgr_vertex_color_rt
• column : pgrouting::tsp::EuclideanDmatrix
• coming : pgr_basic_edge_t
• comparable_distance() : pgrouting::tsp::Dmatrix , pgrouting::tsp::EuclideanDmatrix
• complete_path() : Path
• component : pgr_components_rt
• connect_endEdge() : pgrouting::trsp::EdgeInfo
• connect_startEdge() : pgrouting::trsp::EdgeInfo
• connectEdge() : GraphDefinition
• connectEndEdge() : pgrouting::trsp::Pgr_trspHandler
• connectStartEdge() : pgrouting::trsp::Pgr_trspHandler
• const_iterator : Identifiers< T >
• constiterator : pgrouting::trsp::Rule
• ConstpthIt : Path
• construct_graph() : GraphDefinition , pgrouting::trsp::Pgr_trspHandler
• construct_path() : GraphDefinition , pgrouting::trsp::Pgr_trspHandler
• contracted_vertices : contracted_rt , pgrouting::CH_edge , pgrouting::CH_vertex
• contracted_vertices_size : contracted_rt
• coordinates : pgrouting::tsp::EuclideanDmatrix
• cost : contracted_rt , edge , edge_columns , edge_t , General_path_element_t , Line_graph_full_rt , Line_graph_rt , matrix_cell , path_element , Path_t , pgr_boyer_t , pgr_costFlow_t , pgr_edge_t , Pgr_edge_xy_t , pgr_flow_t , pgr_mst_rt , pgr_prim_rt , pgr_randomSpanningTree_t , pgr_stoerWagner_t , pgrouting::Basic_edge , pgrouting::CH_edge , pgrouting::Line_vertex , pgrouting::trsp::EdgeInfo , pgrouting::trsp::Rule , pgrouting::vrp::Solution
• Cost : pgrouting::vrp::Vehicle
• cost() : pgrouting::vrp::Vehicle , pgrouting::vrp::Vehicle_pickDeliver , Restriction_t , Routes_t , Rule
• cost_compare() : pgrouting::vrp::Vehicle
• cost_only : pgrouting::bidirectional::Pgr_bidirectional< G >
• cost_str() : pgrouting::vrp::Solution
• Cost_Vertex_pair : pgrouting::bidirectional::Pgr_bdAstar< G > , pgrouting::bidirectional::Pgr_bdDijkstra< G > , pgrouting::bidirectional::Pgr_bidirectional< G >
• CostHolder() : pgrouting::trsp::Pgr_trspHandler::CostHolder
• costs : pgrouting::tsp::Dmatrix
• Costs : pgrouting::tsp::Dmatrix
• count_rows() : Pgr_allpairs< G >
• count_tuples : Path
• countInfinityCost() : Path
• cp_members() : pgrouting::Basic_edge , pgrouting::Basic_vertex , pgrouting::CH_edge , pgrouting::CH_vertex , pgrouting::Line_vertex , pgrouting::XY_vertex
• create_edges() : pgrouting::graph::Pgr_lineGraph< G, T_V, T_E >
• create_new_edges() : pgrouting::Pg_points_graph
• curr_result_path : pgrouting::yen::Pgr_ksp< G >
• current_cost : pgrouting::tsp::TSP< MATRIX >
• current_node : pgrouting::trsp::Pgr_trspHandler
• current_tour : pgrouting::tsp::TSP< MATRIX >
• cvTot() : pgrouting::vrp::Solution , pgrouting::vrp::Vehicle , pgrouting::vrp::Vehicle_node