This inheritance list is sorted roughly, but not completely, alphabetically:

[detail level 123]

BiDirAStar
astar_heuristic
pgrouting::algorithms::Pgr_astar< G >::distance_heuristic
default_astar_visitor
pgrouting::algorithms::Pgr_astar< G >::astar_many_goals_visitor	Class for stopping when all targets are found
pgrouting::algorithms::Pgr_astar< G >::astar_one_goal_visitor	Visitor that terminates when we find the goal
default_dijkstra_visitor
Pgr_dijkstra< G >::dijkstra_distance_visitor	Class for stopping when a distance/cost has being surpassed
Pgr_dijkstra< G >::dijkstra_many_goal_visitor	Class for stopping when all targets are found
Pgr_dijkstra< G >::dijkstra_one_goal_visitor	Class for stopping when 1 target is found
CDepotInfo
CMoveInfo
Column_info_t
Coordinate_t
COrderInfo
CostHolder
CostPack
CSolutionInfo
CTourInfo
Customer_t
CVehicleInfo
CVRPSolver
distance_columns
edge
edge_astar
edge_astar_columns
edge_columns
EventHandler
SIGINT_Handler
SIGQUIT_Handler
General_path_element_t
General_vehicle_orders_t
GraphDefinition
GraphEdgeInfo
GraphNodeInfo
Identifiers< T >
Identifiers< int64_t >
Identifiers< V >
MATRIX
pgrouting::tsp::TSP< MATRIX >
matrix_cell
MinHeap
order_columns
PARENT_PATH
Path
path_element
path_element_t
Path_t
Pgr_allpairs< G >
Pgr_allpairs< G >::inf_plus< T >
pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >
pgr_basic_edge_t
Pgr_bdDijkstra< G >
pgr_contracted_blob
Pgr_dijkstra< G >
Pgr_dijkstra< G >::found_goals	Exception for termination
pgr_edge_t
Pgr_edge_xy_t
pgr_flow_t
Pgr_ksp< G >
Pgr_ksp< G >::compPaths
pgr_path_t
pgrouting::algorithms::Pgr_astar< G >
pgrouting::algorithms::Pgr_astar< G >::found_goals	Exception for termination
pgrouting::Basic_edge
pgrouting::Basic_vertex
pgrouting::CH_edge
pgrouting::CH_vertex
pgrouting::contraction::Pgr_contract< G >
pgrouting::contraction::Pgr_deadend< G >
pgrouting::contraction::Pgr_linear< G >
pgrouting::flow::PgrCardinalityGraph< G >
pgrouting::flow::PgrEdgeDisjointPathsGraph< G >
pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
pgrouting::graph::PgrFlowGraph< G >
pgrouting::tsp::Dmatrix
pgrouting::tsp::eucledianDmatrix
pgrouting::tsp::Tour
pgrouting::vrp::Node	Defines a point in 2D space with an id
pgrouting::vrp::Tw_node	Extends the Node class to create a Node with time window attributes
pgrouting::vrp::Vehicle_node	Extend Tw_node to evaluate the vehicle at node level
pgrouting::vrp::Order
pgrouting::vrp::Pgr_pickDeliver
pgrouting::vrp::Solution
pgrouting::vrp::Initial_solution
pgrouting::vrp::Optimize
pgrouting::vrp::Vehicle	Vehicle with time windows
pgrouting::vrp::Vehicle_pickDeliver
pgrouting::XY_vertex
Point
Point_on_edge_t
pointCompare
restrict_columns
restrict_struct
Restrict_t
Routes_t
Rule
SignalHandler
std::exception	STL class
AssertFailedException	Extends std::exception and is the exception that we throw if an assert fails
UserQuitException
StringOperation
StringTokenizer
tokenizer
vehicle_columns
vertex
vertex_columns
vrp_cost_element
vrp_orders
vrp_result_element
vrp_vehicles