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

- f -

• faceBelongs() : pgrouting::alphashape::Pgr_alphaShape
• feasable_orders() : pgrouting::vrp::Vehicle_pickDeliver
• feasible() : pgrouting::vrp::Vehicle_node
• find_adjacent_vertices() : pgrouting::graph::Pgr_contractionGraph< G >
• find_best_I() : pgrouting::vrp::PD_Orders
• find_best_J() : pgrouting::vrp::PD_Orders
• find_closest_city() : pgrouting::tsp::TSP< MATRIX >
• find_restriction() : Path
• finish_vertex() : pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init , pgrouting::visitors::Prim_dijkstra_visitor< V >
• first : pgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init
• Fleet() : pgrouting::vrp::Fleet , pgrouting::vrp::Pgr_pickDeliver
• fleet : pgrouting::vrp::Solution
• flow : pgr_flow_t
• flow_dfs() : pgrouting::graph::PgrFlowGraph
• floydWarshall() : Pgr_allpairs< G >
• forbiddenVertices : pgrouting::contraction::Pgr_deadend< G >
• forward_cost : pgrouting::bidirectional::Pgr_bidirectional< G >
• forward_edge : pgrouting::bidirectional::Pgr_bidirectional< G >
• forward_finished : pgrouting::bidirectional::Pgr_bidirectional< G >
• forward_predecessor : pgrouting::bidirectional::Pgr_bidirectional< G >
• forward_queue : pgrouting::bidirectional::Pgr_bidirectional< G >
• found() : pgrouting::bidirectional::Pgr_bidirectional< G >
• fraction : Point_on_edge_t
• from_order : pgrouting::vrp::Swap_info
• from_truck : pgrouting::vrp::Swap_info
• from_v : pgr_mst_rt
• from_vid : matrix_cell
• front() : Identifiers< T > , Path