Here is a list of all file members with links to the files they belong to:

- p -

• path_element_tt : trsp.h , trsp_types.h
• PDP : GraphDefinition.h
• PDVI : GraphDefinition.h
• PG_FUNCTION_INFO_V1() : astar.c , chinesePostman.c , ksp.c , version.c , withPoints.c , turnRestrictedPath.c , bipartite.c , withPoints_ksp.c , lineGraph.c , bdAstar.c , sequentialVertexColoring.c , lineGraphFull.c , edge_disjoint_paths.c , articulationPoints.c , max_flow.c , maximum_cardinality_matching.c , floydWarshall.c , bdDijkstra.c , biconnectedComponents.c , minCostMaxFlow.c , stoerWagner.c , bridges.c , pickDeliver.c , pickDeliverEuclidean.c , bellman_ford.c , connectedComponents.c , boyerMyrvold.c , isPlanar.c , makeConnected.c , kruskal.c , prim.c , johnson.c , bellman_ford_neg.c , strongComponents.c , randomSpanningTree.c , topologicalSort.c , contractGraph.c , transitiveClosure.c , depthFirstSearch.c , edwardMoore.c , dagShortestPath.c , new_trsp.c , trsp.c , dijkstra.c , euclideanTSP.c , TSP.c , alphaShape.c , binaryBreadthFirstSearch.c , dijkstraVia.c , _version.c , lengauerTarjanDominatorTree.c , _version.c , breadthFirstSearch.c , many_to_dist_driving_distance.c , _version.c , many_to_dist_withPointsDD.c , _version.c
• PG_MODULE_MAGIC : dijkstra.c
• pgassert : pgr_assert.h
• pgassertwm : pgr_assert.h
• pgr_alloc() : pgr_alloc.hpp
• pgr_astar() : astar_driver.cpp
• pgr_bdAstar() : bdAstar_driver.cpp
• pgr_bdDijkstra() : bdDijkstra_driver.cpp
• pgr_bellman_ford() : bellman_ford_driver.cpp , bellman_ford_neg_driver.cpp
• pgr_binaryBreadthFirstSearch() : binaryBreadthFirstSearch_driver.cpp
• pgr_breadthFirstSearch() : breadthFirstSearch_driver.cpp
• pgr_check_any_integer_type() : get_check_data.c , get_check_data.h
• pgr_check_any_integerarray_type() : get_check_data.c , get_check_data.h
• pgr_check_any_numerical_type() : get_check_data.c , get_check_data.h
• pgr_check_boolean_type() : get_check_data.h
• pgr_check_char_type() : get_check_data.c , get_check_data.h
• pgr_check_text_type() : get_check_data.c , get_check_data.h
• pgr_cstring2char() : postgres_connection.c , postgres_connection.h
• pgr_dagShortestPath() : dagShortestPath_driver.cpp
• PGR_DBG : debug_macro.h
• pgr_depthFirstSearch() : depthFirstSearch_driver.cpp
• pgr_dijkstra() : withPoints_driver.cpp
• pgr_dijkstraTR() : turnRestrictedPath_driver.cpp
• pgr_edwardMoore() : edwardMoore_driver.cpp
• pgr_error() : e_report.c , e_report.h
• pgr_error2() : e_report.c , e_report.h
• pgr_fetch_column_info() : get_check_data.c , get_check_data.h
• pgr_fetch_row() : coordinates_input.c , delauny_input.c , matrixRows_input.c , pgr_point_input.c
• pgr_floydWarshall() : pgr_allpairs.hpp
• pgr_free() : pgr_alloc.hpp
• pgr_get_basic_edges() : edges_input.c , edges_input.h
• pgr_get_bigIntArr() : arrays_input.c
• pgr_get_bigIntArray() : arrays_input.c , arrays_input.h
• pgr_get_bigIntArray_allowEmpty() : arrays_input.c , arrays_input.h
• pgr_get_combinations() : combinations_input.c , combinations_input.h
• pgr_get_coordinates() : coordinates_input.c , coordinates_input.h
• pgr_get_costFlow_edges() : edges_input.c , edges_input.h
• pgr_get_delauny() : delauny_input.c , delauny_input.h
• pgr_get_edges() : edges_input.c , edges_input.h
• pgr_get_edges_no_id() : edges_input.h , edges_input.c
• pgr_get_edges_reversed() : edges_input.c , edges_input.h
• pgr_get_edges_xy() : edges_input.c , edges_input.h
• pgr_get_edges_xy_reversed() : edges_input.c , edges_input.h
• pgr_get_flow_edges() : edges_input.c , edges_input.h
• pgr_get_matrixRows() : matrixRows_input.c , matrixRows_input.h
• pgr_get_pd_orders() : orders_input.c , orders_input.h
• pgr_get_pd_orders_general() : orders_input.c
• pgr_get_pd_orders_with_id() : orders_input.c , orders_input.h
• pgr_get_points() : points_input.h , points_input.c
• pgr_get_restrictions() : restrictions_input.c , restrictions_input.h
• pgr_get_vehicles() : vehicles_input.c , vehicles_input.h
• pgr_get_vehicles_general() : vehicles_input.c
• pgr_get_vehicles_with_id() : vehicles_input.c , vehicles_input.h
• pgr_global_report() : e_report.c , e_report.h
• pgr_johnson() : pgr_allpairs.hpp
• pgr_msg() : pgr_alloc.cpp , pgr_alloc.hpp
• pgr_notice() : e_report.c , e_report.h
• pgr_notice2() : e_report.c , e_report.h
• pgr_point_input() : pgr_point_input.c , pgr_point_input.h
• pgr_randomSpanningTree() : randomSpanningTree_driver.cpp
• pgr_send_error() : postgres_connection.c , postgres_connection.h
• pgr_sequentialVertexColoring() : sequentialVertexColoring_driver.cpp
• pgr_SPI_connect() : postgres_connection.h , postgres_connection.c
• pgr_SPI_cursor_open() : postgres_connection.h , postgres_connection.c
• pgr_SPI_finish() : postgres_connection.c , postgres_connection.h
• pgr_SPI_getBigInt() : get_check_data.h , get_check_data.c
• pgr_SPI_getBigIntArr() : get_check_data.h , get_check_data.c
• pgr_SPI_getChar() : get_check_data.h , get_check_data.c
• pgr_SPI_getFloat8() : get_check_data.c , get_check_data.h
• pgr_SPI_getText() : get_check_data.c , get_check_data.h
• pgr_SPI_prepare() : postgres_connection.c , postgres_connection.h
• pgr_stoerWagner() : stoerWagner_driver.cpp
• pgr_topologicalSort() : topologicalSort_driver.cpp
• pgr_transitiveClosure() : transitiveClosure_driver.cpp
• pgr_version() : version.c
• PIB : GraphDefinition.h
• POSTGRES_VERSION : _version.h
• pred() : pgr_tsp.cpp , pgr_tsp.hpp
• process() : prim.c , bdDijkstra.c , kruskal.c , contractGraph.c , isPlanar.c , TSP.c , johnson.c , depthFirstSearch.c , articulationPoints.c , connectedComponents.c , edge_disjoint_paths.c , lineGraphFull.c , max_flow.c , bdAstar.c , pickDeliverEuclidean.c , pickDeliver.c , sequentialVertexColoring.c , biconnectedComponents.c , bellman_ford_neg.c , bellman_ford.c , chinesePostman.c , stoerWagner.c , withPoints.c , floydWarshall.c , lengauerTarjanDominatorTree.c , dijkstraVia.c , astar.c , makeConnected.c , withPoints_ksp.c , edwardMoore.c , bipartite.c , binaryBreadthFirstSearch.c , lineGraph.c , breadthFirstSearch.c , turnRestrictedPath.c , strongComponents.c , randomSpanningTree.c , maximum_cardinality_matching.c , minCostMaxFlow.c , euclideanTSP.c , many_to_dist_withPointsDD.c , dijkstra.c , dagShortestPath.c , many_to_dist_driving_distance.c , bridges.c , boyerMyrvold.c , alphaShape.c , transitiveClosure.c , topologicalSort.c
• process_combinations() : dijkstra.c
• PROJECT_GIT_HASH : _version.h
• PROJECT_LIB_NAME : _version.h