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

- 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 >
• generate_mst() : pgrouting::functions::Pgr_kruskal< G > , pgrouting::functions::Pgr_mst< G > , pgrouting::functions::Pgr_prim< G >
• generate_postgres_data() : Path
• generateboyerMyrvold() : pgrouting::functions::Pgr_boyerMyrvold< G >
• generatemakeConnected() : pgrouting::functions::Pgr_makeConnected< G >
• generatestoerWagner() : Pgr_stoerWagner< G >
• generatetopologicalSort() : Pgr_topologicalSort< G >
• generatetransitiveClosure() : Pgr_transitiveClosure< G >
• geom : GeomText_t
• get_boost_vertex() : pgrouting::flow::PgrCardinalityGraph< G > , pgrouting::graph::PgrFlowGraph
• get_cost() : pgrouting::trsp::EdgeInfo
• get_cost_matrix() : pgrouting::vrp::Pgr_pickDeliver
• get_drivingDistance_with_equicost_paths() : pgrouting::Pgr_dijkstra< G >
• get_edge() : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• get_edge_data() : pgrouting::Pg_points_graph
• get_edge_disjoint_paths() : pgrouting::graph::PgrFlowGraph
• get_edge_id() : pgrouting::flow::PgrCardinalityGraph< G > , pgrouting::graph::Pgr_base_graph< G, T_V, T_E > , pgrouting::graph::PgrFlowGraph , pgrouting::Pg_points_graph
• get_error() : pgrouting::Pgr_messages
• get_flow_edges() : pgrouting::graph::PgrFlowGraph
• get_id() : pgrouting::tsp::Dmatrix , pgrouting::tsp::EuclideanDmatrix
• get_idx() : pgrouting::trsp::EdgeInfo
• get_index() : pgrouting::tsp::Dmatrix , pgrouting::tsp::EuclideanDmatrix
• get_kind() : pgrouting::vrp::Pgr_pickDeliver , pgrouting::vrp::Solution
• get_log() : pgrouting::Pgr_messages , pgrouting::tsp::TSP< MATRIX >
• get_matched_vertices() : pgrouting::flow::PgrCardinalityGraph< G >
• get_min_cost_edge() : pgrouting::graph::Pgr_contractionGraph< G >
• get_next_id() : pgrouting::contraction::Pgr_linear< G >
• get_nodes() : pgrouting::vrp::Pgr_pickDeliver
• get_notice() : pgrouting::Pgr_messages
• get_paths() : Pgr_bellman_ford< G > , Pgr_dag< G > , pgrouting::algorithms::Pgr_astar< G > , pgrouting::Pgr_dijkstra< G >
• get_pg_dd_path() : Path
• get_pg_ksp_path() : Path
• get_pg_turn_restricted_path() : Path
• get_postgres_result() : pgrouting::vrp::Pgr_pickDeliver , pgrouting::vrp::Solution , pgrouting::vrp::Vehicle
• get_postgres_results_directed() : pgrouting::graph::Pgr_lineGraph< G, T_V, T_E > , pgrouting::graph::Pgr_lineGraphFull< G, T_V, T_E >
• get_results() : pgrouting::functions::Pgr_breadthFirstSearch< G > , pgrouting::functions::Pgr_depthFirstSearch< G > , pgrouting::functions::Pgr_mst< G > , pgrouting::functions::Pgr_sequentialVertexColoring< G > , pgrouting::yen::Pgr_ksp< G > , pgrouting::yen::Pgr_turnRestrictedPath< G >
• get_row() : pgrouting::tsp::Dmatrix , pgrouting::tsp::EuclideanDmatrix
• get_single_cost() : GraphDefinition
• get_stats() : pgrouting::tsp::TSP< MATRIX >
• get_tot_cost() : pgrouting::trsp::Pgr_trspHandler
• get_tour() : pgrouting::tsp::TSP< MATRIX >
• get_truck() : pgrouting::vrp::Fleet
• get_V() : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• get_vertex_id() : pgrouting::flow::PgrCardinalityGraph< G > , pgrouting::graph::PgrFlowGraph
• GetBoostVertex() : pgrouting::graph::PgrCostFlowGraph
• getDeltaReverse() : pgrouting::tsp::TSP< MATRIX >
• getDeltaSlide() : pgrouting::tsp::TSP< MATRIX >
• getDeltaSwap() : pgrouting::tsp::TSP< MATRIX >
• getDropPosLowLimit() : pgrouting::vrp::Vehicle
• GetEdgeId() : pgrouting::graph::PgrCostFlowGraph
• getFirstSolution() : pgrouting::yen::Pgr_ksp< G >
• GetFlowEdges() : pgrouting::graph::PgrCostFlowGraph
• GetMaxFlow() : pgrouting::graph::PgrCostFlowGraph
• getPath() : pgrouting::functions::Pgr_binaryBreadthFirstSearch< G > , pgrouting::functions::Pgr_edwardMoore< G >
• GetPathEdges() : pgrouting::graph::PgrDirectedChPPGraph
• getPosHighLimit() : pgrouting::vrp::Vehicle
• getPosLowLimit() : pgrouting::vrp::Vehicle
• getRestrictionCost() : GraphDefinition , pgrouting::trsp::Pgr_trspHandler
• getSubpath() : Path
• GetVertexId() : pgrouting::graph::PgrCostFlowGraph
• going : pgr_basic_edge_t
• graceful_quit_ : SIGINT_Handler
• gracefulQuit() : SIGINT_Handler
• graph : pgrouting::alphashape::Pgr_alphaShape , pgrouting::bidirectional::Pgr_bidirectional< G >
• Graph : pgrouting::functions::Pgr_sequentialVertexColoring< G >
• graph : pgrouting::graph::Pgr_base_graph< G, T_V, T_E > , pgrouting::graph::PgrCostFlowGraph , pgrouting::graph::PgrFlowGraph
• graph_add_edge() : 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 >
• graph_add_edge_no_create_vertex() : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• graph_add_min_edge_no_parallel() : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• graph_add_neg_edge() : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• GraphDefinition() : GraphDefinition
• greedyInitial() : pgrouting::tsp::TSP< MATRIX >