- e -

• edge_disjoint_paths() : pgrouting::graph::PgrFlowGraph
• 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_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 >
• edmonds_karp() : pgrouting::graph::PgrFlowGraph
• edwardMoore() : pgrouting::functions::Pgr_edwardMoore< G >
• 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_id() : Path
• end_site() : pgrouting::vrp::Vehicle
• endConnectedEdge() : pgrouting::trsp::EdgeInfo
• endNode() : pgrouting::trsp::EdgeInfo
• erase() : Path , pgrouting::vrp::Vehicle , pgrouting::vrp::Vehicle_pickDeliver
• 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 >