Class Hierarchy

Go to the graphical class hierarchy

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

[detail level 1234]

►Castar_heuristic
Cpgrouting::algorithms::Pgr_astar< G >::distance_heuristic
►Cdefault_astar_visitor
Cpgrouting::algorithms::Pgr_astar< G >::astar_many_goals_visitor	Class for stopping when all targets are found
Cpgrouting::algorithms::Pgr_astar< G >::astar_one_goal_visitor	Visitor that terminates when we find the goal
►Cdefault_bfs_visitor
Cpgrouting::visitors::Edges_order_bfs_visitor< E >
►Cdefault_dfs_visitor
Cpgrouting::visitors::Dfs_visitor< V, E, G >
Cpgrouting::visitors::Dfs_visitor_with_root< V, E >
Cpgrouting::visitors::Edges_order_dfs_visitor< E >
►Cdefault_dijkstra_visitor
CPgr_dag< G >::dijkstra_many_goal_visitor	Class for stopping when all targets are found
CPgr_dag< G >::dijkstra_one_goal_visitor	Class for stopping when 1 target is found
Cpgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor	Class for stopping when a distance/cost has being surpassed
Cpgrouting::Pgr_dijkstra< G >::dijkstra_distance_visitor_no_init	Class for stopping when a distance/cost has being surpassed
Cpgrouting::Pgr_dijkstra< G >::dijkstra_many_goal_visitor	Class for stopping when all targets are found
Cpgrouting::visitors::dijkstra_one_goal_visitor< V >
Cpgrouting::visitors::Prim_dijkstra_visitor< V >
CColumn_info_t
Ccontracted_rt
CCoordinate_t
CCostHolder
CDelauny_t
Cedge
Cedge_columns
Cedge_t
►CEventHandler
CSIGINT_Handler
CSIGQUIT_Handler
CGeneral_path_element_t
CGeneral_vehicle_orders_t
CGeomText_t
CGraphDefinition
CGraphEdgeInfo
CIdentifiers< T >
CIdentifiers< int64_t >
CIdentifiers< size_t >
CIdentifiers< V >
CLine_graph_full_rt
CLine_graph_rt
►CMATRIX
Cpgrouting::tsp::TSP< MATRIX >
Cmatrix_cell
CPARENT_PATH
CPath
Cpath_element
CPath_t
CPgr_allpairs< G >
CPgr_allpairs< G >::inf_plus< T >
Cpgrouting::graph::Pgr_base_graph< BG, XY_vertex, Basic_edge >
►Cpgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >
Cpgrouting::graph::Pgr_contractionGraph< G >
Cpgr_basic_edge_t
Cpgr_bipartite_rt
Cpgr_boyer_t
Cpgr_combination_t
Cpgr_components_rt
Cpgr_costFlow_t
CPgr_dag< G >
CPgr_dag< G >::found_goals
Cpgr_edge_t
CPgr_edge_xy_t
Cpgr_flow_t
Cpgr_ltdtree_rt
Cpgr_makeConnected_t
Cpgr_mst_rt
CPgr_point_t
Cpgr_prim_rt
CPgr_randomSpanningTree< G >
Cpgr_randomSpanningTree_t
CPgr_stoerWagner< G >
Cpgr_stoerWagner_t
CPgr_topologicalSort< G >
Cpgr_topologicalSort_t
CPgr_transitiveClosure< G >
Cpgr_vertex_color_rt
Cpgrouting::algorithms::Pgr_astar< G >
Cpgrouting::algorithms::Pgr_astar< G >::found_goals
Cpgrouting::alphashape::anonymous_namespace{pgr_alphaShape.cpp}::CompareRadius
Cpgrouting::alphashape::Pgr_alphaShape::EdgesFilter
Cpgrouting::Basic_edge
Cpgrouting::Basic_vertex
►Cpgrouting::bidirectional::Pgr_bidirectional< G >
Cpgrouting::bidirectional::Pgr_bdAstar< G >
Cpgrouting::bidirectional::Pgr_bdDijkstra< G >
Cpgrouting::CH_edge
Cpgrouting::CH_vertex
Cpgrouting::compPathsLess
Cpgrouting::contraction::Pgr_contract< G >
Cpgrouting::contraction::Pgr_deadend< G >
Cpgrouting::contraction::Pgr_linear< G >
Cpgrouting::flow::PgrCardinalityGraph< G >
Cpgrouting::found_goals	Exception for visitor termination
Cpgrouting::functions::Pgr_binaryBreadthFirstSearch< G >
Cpgrouting::functions::Pgr_breadthFirstSearch< G >
Cpgrouting::functions::Pgr_depthFirstSearch< G >
Cpgrouting::functions::Pgr_edwardMoore< G >
►Cpgrouting::functions::Pgr_mst< G >
Cpgrouting::functions::Pgr_kruskal< G >
Cpgrouting::functions::Pgr_prim< G >
Cpgrouting::functions::Pgr_mst< G >::InSpanning
Cpgrouting::functions::Pgr_sequentialVertexColoring< G >
►Cpgrouting::graph::Pgr_base_graph< G, T_V, T_E >
Cpgrouting::graph::Pgr_lineGraph< G, T_V, T_E >
Cpgrouting::graph::Pgr_lineGraphFull< G, T_V, T_E >
Cpgrouting::graph::PgrCostFlowGraph
Cpgrouting::graph::PgrDirectedChPPGraph
Cpgrouting::graph::PgrFlowGraph
►Cpgrouting::Identifier
►Cpgrouting::vrp::Dnode	Defines a the basic operations when data is a matrix
►Cpgrouting::vrp::Tw_node	Extends the Node class to create a Node with time window attributes
Cpgrouting::vrp::Vehicle_node	Extend Tw_node to evaluate the vehicle at node level
Cpgrouting::vrp::Order
►Cpgrouting::vrp::Vehicle	Vehicle with time windows
Cpgrouting::vrp::Vehicle_pickDeliver
Cpgrouting::Line_vertex
Cpgrouting::Pg_points_graph::pointCompare
Cpgrouting::Pgr_dijkstra< G >
►Cpgrouting::Pgr_messages
CPgr_bellman_ford< G >
Cpgrouting::alphashape::Pgr_alphaShape
Cpgrouting::functions::Pgr_Bipartite< G >
Cpgrouting::functions::Pgr_boyerMyrvold< G >
Cpgrouting::functions::Pgr_LTDTree< G >
Cpgrouting::functions::Pgr_makeConnected< G >
Cpgrouting::Pg_points_graph
►Cpgrouting::yen::Pgr_ksp< G >
Cpgrouting::yen::Pgr_turnRestrictedPath< G >
Cpgrouting::trsp::EdgeInfo
Cpgrouting::trsp::Pgr_trspHandler
Cpgrouting::trsp::Pgr_trspHandler::CostHolder
Cpgrouting::trsp::Pgr_trspHandler::Predecessor
Cpgrouting::trsp::Rule
Cpgrouting::tsp::Dmatrix
Cpgrouting::tsp::EuclideanDmatrix
Cpgrouting::tsp::Tour
Cpgrouting::vrp::Fleet
Cpgrouting::vrp::PD_Orders
►Cpgrouting::vrp::PD_problem
Cpgrouting::vrp::Pgr_pickDeliver
►Cpgrouting::vrp::Solution
Cpgrouting::vrp::Initial_solution
Cpgrouting::vrp::Optimize
Cpgrouting::vrp::Swap_bk
Cpgrouting::vrp::Swap_bk::Compare
Cpgrouting::vrp::Swap_info
Cpgrouting::XY_vertex
►Cpgrouting::yen::Pgr_ksp< G >::Visitor
Cpgrouting::yen::Pgr_turnRestrictedPath< G >::Myvisitor
Cpgrouting::yen::Pgr_turnRestrictedPath< G >::found_goals
CPickDeliveryOrders_t
CPoint_on_edge_t
Crestrict_columns
Crestrict_struct
CRestriction_t
CRoutes_t
CRule
CSignalHandler
►Cstd::exception	STL class
CAssertFailedException	Extends std::exception and is the exception that we throw if an assert fails
CUserQuitException
CtransitiveClosure_rt
CVehicle_t