PGROUTING
3.2
Main Page
Related Pages
Namespaces
Namespace List
Namespace Members
All
a
b
c
d
e
f
g
i
l
m
o
p
r
s
t
u
v
w
x
Functions
a
b
c
d
e
g
i
o
p
s
Typedefs
Enumerations
Enumerator
Classes
Class List
Class Index
Class Hierarchy
Class Members
All
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
y
~
Functions
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
r
s
t
u
v
w
x
y
~
Variables
a
b
c
d
e
f
g
i
l
m
n
o
p
q
r
s
t
u
v
w
x
y
Typedefs
b
c
d
e
g
i
l
o
p
s
v
Enumerations
Enumerator
Related Functions
c
d
e
i
o
p
s
Files
File List
File Members
All
_
a
b
c
d
e
f
g
i
l
m
o
p
r
s
t
u
v
Functions
_
a
c
d
e
f
g
i
o
p
r
s
t
Variables
Typedefs
Enumerations
Enumerator
Macros
•
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
]
▼
N
pgrouting
Book keeping class for swapping orders between vehicles
►
N
algorithms
►
C
Pgr_astar
C
astar_many_goals_visitor
Class for stopping when all targets are found
C
astar_one_goal_visitor
Visitor that terminates when we find the goal
C
distance_heuristic
C
found_goals
►
N
alphashape
►
N
anonymous_namespace{pgr_alphaShape.cpp}
C
CompareRadius
►
C
Pgr_alphaShape
C
EdgesFilter
►
N
bidirectional
C
Pgr_bdAstar
C
Pgr_bdDijkstra
C
Pgr_bidirectional
►
N
contraction
C
Pgr_contract
C
Pgr_deadend
C
Pgr_linear
►
N
flow
C
PgrCardinalityGraph
►
N
functions
C
Pgr_binaryBreadthFirstSearch
C
Pgr_Bipartite
C
Pgr_boyerMyrvold
C
Pgr_breadthFirstSearch
C
Pgr_depthFirstSearch
C
Pgr_edwardMoore
C
Pgr_kruskal
C
Pgr_LTDTree
C
Pgr_makeConnected
►
C
Pgr_mst
C
InSpanning
C
Pgr_prim
C
Pgr_sequentialVertexColoring
►
N
graph
Boost::graph simplified to
pgRouting
needs This class gives the handling basics of a boost::graph of kind G where G: can be an undirected graph or a directed graph
C
Pgr_base_graph
C
Pgr_contractionGraph
C
Pgr_lineGraph
C
Pgr_lineGraphFull
C
PgrCostFlowGraph
C
PgrDirectedChPPGraph
C
PgrFlowGraph
►
N
trsp
C
EdgeInfo
►
C
Pgr_trspHandler
C
CostHolder
C
Predecessor
C
Rule
►
N
tsp
C
Dmatrix
C
EuclideanDmatrix
C
Tour
C
TSP
►
N
visitors
C
Dfs_visitor
C
Dfs_visitor_with_root
C
dijkstra_one_goal_visitor
C
Edges_order_bfs_visitor
C
Edges_order_dfs_visitor
C
Prim_dijkstra_visitor
►
N
vrp
C
Dnode
Defines a the basic operations when data is a matrix
C
Fleet
C
Initial_solution
C
Optimize
C
Order
C
PD_Orders
C
PD_problem
C
Pgr_pickDeliver
C
Solution
►
C
Swap_bk
C
Compare
C
Swap_info
C
Tw_node
Extends the Node class to create a Node with time window attributes
C
Vehicle
Vehicle
with time windows
C
Vehicle_node
Extend
Tw_node
to evaluate the vehicle at node level
C
Vehicle_pickDeliver
►
N
yen
►
C
Pgr_ksp
C
Visitor
►
C
Pgr_turnRestrictedPath
C
found_goals
C
Myvisitor
C
Basic_edge
C
Basic_vertex
C
CH_edge
C
CH_vertex
C
compPathsLess
C
found_goals
Exception for visitor termination
C
Identifier
C
Line_vertex
►
C
Pg_points_graph
C
pointCompare
►
C
Pgr_dijkstra
C
dijkstra_distance_visitor
Class for stopping when a distance/cost has being surpassed
C
dijkstra_distance_visitor_no_init
Class for stopping when a distance/cost has being surpassed
C
dijkstra_many_goal_visitor
Class for stopping when all targets are found
C
Pgr_messages
C
XY_vertex
C
AssertFailedException
Extends std::exception and is the exception that we throw if an assert fails
C
Column_info_t
C
contracted_rt
C
Coordinate_t
C
CostHolder
C
Delauny_t
C
edge
C
edge_columns
C
edge_t
C
EventHandler
C
General_path_element_t
C
General_vehicle_orders_t
C
GeomText_t
C
GraphDefinition
C
GraphEdgeInfo
C
Identifiers
C
Line_graph_full_rt
C
Line_graph_rt
C
matrix_cell
C
PARENT_PATH
C
Path
C
path_element
C
Path_t
▼
C
Pgr_allpairs
C
inf_plus
C
pgr_basic_edge_t
C
Pgr_bellman_ford
C
pgr_bipartite_rt
C
pgr_boyer_t
C
pgr_combination_t
C
pgr_components_rt
C
pgr_costFlow_t
▼
C
Pgr_dag
C
dijkstra_many_goal_visitor
Class for stopping when all targets are found
C
dijkstra_one_goal_visitor
Class for stopping when 1 target is found
C
found_goals
C
pgr_edge_t
C
Pgr_edge_xy_t
C
pgr_flow_t
C
pgr_ltdtree_rt
C
pgr_makeConnected_t
C
pgr_mst_rt
C
Pgr_point_t
C
pgr_prim_rt
C
Pgr_randomSpanningTree
C
pgr_randomSpanningTree_t
C
Pgr_stoerWagner
C
pgr_stoerWagner_t
C
Pgr_topologicalSort
C
pgr_topologicalSort_t
C
Pgr_transitiveClosure
C
pgr_vertex_color_rt
C
PickDeliveryOrders_t
C
Point_on_edge_t
C
restrict_columns
C
restrict_struct
C
Restriction_t
C
Routes_t
C
Rule
C
SIGINT_Handler
C
SignalHandler
C
SIGQUIT_Handler
C
transitiveClosure_rt
C
UserQuitException
C
Vehicle_t
Generated on Tue May 25 2021 15:09:50 for PGROUTING by
1.8.17
1.8.17 
