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

- 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_idx : pgrouting::trsp::Pgr_trspHandler::Predecessor
• E_it : pgrouting::flow::PgrCardinalityGraph< G > , pgrouting::graph::PgrCostFlowGraph , pgrouting::graph::PgrFlowGraph
• E_to_id : pgrouting::flow::PgrCardinalityGraph< G > , pgrouting::graph::PgrFlowGraph
• ed_ind : PARENT_PATH
• edge : General_path_element_t , Line_graph_full_rt , Path_t , pgr_flow_t , pgr_mst_rt , pgr_prim_rt , pgr_randomSpanningTree_t , pgr_stoerWagner_t , Routes_t
• edge_disjoint_paths() : pgrouting::graph::PgrFlowGraph
• edge_id : path_element , pgr_basic_edge_t , pgr_costFlow_t , Point_on_edge_t
• edge_not_relaxed() : pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init
• edge_relaxed() : pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init
• edgeID() : pgrouting::trsp::EdgeInfo
• EdgeInfo() : pgrouting::trsp::EdgeInfo
• edges : pgrouting::alphashape::Pgr_alphaShape::EdgesFilter , pgrouting::functions::Pgr_mst< G >::InSpanning , pgrouting::graph::PgrDirectedChPPGraph
• edges_of_points() : pgrouting::Pg_points_graph
• Edges_order_bfs_visitor() : pgrouting::visitors::Edges_order_bfs_visitor< E >
• Edges_order_dfs_visitor() : pgrouting::visitors::Edges_order_dfs_visitor< E >
• edges_size_type : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• edgeToId : pgrouting::graph::PgrDirectedChPPGraph
• edgeToIdx : pgrouting::graph::PgrDirectedChPPGraph
• edgeVisited : pgrouting::graph::PgrDirectedChPPGraph
• edmonds_karp() : pgrouting::graph::PgrFlowGraph
• edwardMoore() : pgrouting::functions::Pgr_edwardMoore< G >
• 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 >
• eliminate_details() : pgrouting::Pg_points_graph
• eliminate_details_dd() : pgrouting::Pg_points_graph
• empty() : Identifiers< T > , Path , pgrouting::tsp::Dmatrix , pgrouting::vrp::Swap_bk , pgrouting::vrp::Vehicle
• empty_path() : Path
• end() : Identifiers< T > , Path , pgrouting::trsp::Rule , pgrouting::vrp::Fleet , pgrouting::vrp::PD_Orders
• end_close_t : Vehicle_t
• end_id : General_path_element_t , Path
• end_node_id : Vehicle_t
• end_open_t : Vehicle_t
• end_service_t : Vehicle_t
• end_site() : pgrouting::vrp::Vehicle
• end_vid : pgr_makeConnected_t , Routes_t
• end_x : Vehicle_t
• end_y : Vehicle_t
• endConnectedEdge() : pgrouting::trsp::EdgeInfo
• endCost : CostHolder , pgrouting::trsp::Pgr_trspHandler::CostHolder
• endNode() : pgrouting::trsp::EdgeInfo
• 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
• epsilon : pgrouting::tsp::TSP< MATRIX >
• EPSILON : pgrouting::vrp::Solution
• equi_cost : Path
• erase() : Path , pgrouting::vrp::Vehicle , pgrouting::vrp::Vehicle_pickDeliver
• error : pgrouting::Pgr_messages
• estimated_delta : pgrouting::vrp::Swap_info
• eToId : pgrouting::graph::PgrCostFlowGraph
• eType : Column_info_t
• EuclideanDmatrix() : pgrouting::tsp::EuclideanDmatrix
• EulerCircuitDFS() : pgrouting::graph::PgrDirectedChPPGraph
• evaluate() : pgrouting::vrp::Vehicle , pgrouting::vrp::Vehicle_node
• examine_edge() : pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init , pgrouting::visitors::Dfs_visitor< V, E, G >
• examine_vertex() : Pgr_dag< G >::dijkstra_many_goal_visitor , Pgr_dag< G >::dijkstra_one_goal_visitor , pgrouting::algorithms::Pgr_astar< G >::astar_many_goals_visitor , pgrouting::algorithms::Pgr_astar< G >::astar_one_goal_visitor , pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor , pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init , pgrouting::Pgr_dijkstra< G >::dijkstra_many_goal_visitor , pgrouting::visitors::dijkstra_one_goal_visitor< V >
• execute_drivingDistance() : pgrouting::Pgr_dijkstra< G >
• execute_drivingDistance_no_init() : pgrouting::Pgr_dijkstra< G >
• executeYen() : pgrouting::yen::Pgr_ksp< G >
• explore() : GraphDefinition , pgrouting::trsp::Pgr_trspHandler
• explore_backward() : pgrouting::bidirectional::Pgr_bdAstar< G > , pgrouting::bidirectional::Pgr_bdDijkstra< G > , pgrouting::bidirectional::Pgr_bidirectional< G >
• explore_forward() : pgrouting::bidirectional::Pgr_bdAstar< G > , pgrouting::bidirectional::Pgr_bdDijkstra< G > , pgrouting::bidirectional::Pgr_bidirectional< G >