PGROUTING
2.6-dev
Main Page
Related Pages
Namespaces
Classes
Files
Class List
Class Index
Class Hierarchy
Class Members
All
Classes
Namespaces
Files
Functions
Variables
Typedefs
Enumerations
Enumerator
Friends
Macros
Pages
Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level
1
2
3
4
]
pgrouting
Book keeping class for swapping orders between vehicles
algorithms
Pgr_astar
astar_many_goals_visitor
Class for stopping when all targets are found
astar_one_goal_visitor
Visitor that terminates when we find the goal
distance_heuristic
found_goals
Exception for termination
bidirectional
Pgr_bdAstar
Pgr_bdDijkstra
Pgr_bidirectional
contraction
Pgr_contract
Pgr_deadend
Pgr_linear
flow
PgrCardinalityGraph
graph
Boost::graph simplified to pgRouting needs
Pgr_base_graph
Pgr_componentsGraph
Pgr_contractionGraph
Pgr_lineGraph
PgrFlowGraph
tsp
Dmatrix
eucledianDmatrix
Tour
TSP
vrp
Base_node
Defines the operations that can be performed in a 2D node
Dnode
Defines a the basic operations when data is a matrix
Fleet
Initial_solution
Node
Defines a point in 2D space with an id
Optimize
Order
PD_Orders
PD_problem
Pgr_pickDeliver
Solution
Swap_bk
Compare
Swap_info
Tw_node
Extends the
Node
class to create a
Node
with time window attributes
Vehicle
Vehicle
with time windows
Vehicle_node
Extend
Tw_node
to evaluate the vehicle at node level
Vehicle_pickDeliver
Basic_edge
Basic_vertex
CH_edge
CH_vertex
Identifier
Line_vertex
Pgr_messages
XY_vertex
AssertFailedException
Extends std::exception and is the exception that we throw if an assert fails
Column_info_t
contracted_rt
Coordinate_t
CostHolder
edge
edge_columns
EventHandler
General_path_element_t
General_vehicle_orders_t
GraphDefinition
GraphEdgeInfo
Identifiers
Line_graph_rt
matrix_cell
PARENT_PATH
Path
path_element
Path_t
Pgr_allpairs
inf_plus
pgr_basic_edge_t
Pgr_components
pgr_components_rt
Pgr_dijkstra
dijkstra_distance_visitor
Class for stopping when a distance/cost has being surpassed
dijkstra_distance_visitor_no_init
Class for stopping when a distance/cost has being surpassed
dijkstra_many_goal_visitor
Class for stopping when all targets are found
dijkstra_one_goal_visitor
Class for stopping when 1 target is found
found_goals
Exception for termination
Pgr_dijkstraTRSP
pgr_edge_t
Pgr_edge_xy_t
pgr_flow_t
Pgr_ksp
compPaths
PickDeliveryOrders_t
Point_on_edge_t
pointCompare
restrict_columns
restrict_struct
Restrict_t
Restriction
Routes_t
Rule
SIGINT_Handler
SignalHandler
SIGQUIT_Handler
StringOperation
StringTokenizer
UserQuitException
Vehicle_t
vertex
vertex_columns
Generated on Wed Sep 13 2017 11:33:32 for PGROUTING by
1.8.6