Experimental and Proposed functions¶
Experimental and Proposed functions
Warning
These are proposed functions
- They are not officially of the current release.
- They likely will not be officially be part of the next release:
- The functions might not make use of ANY-INTEGER and ANY-NUMERICAL
- Name might change.
- Signature might change.
- Functionality might change.
- pgTap tests might be missing.
- Might need c/c++ coding.
- May lack documentation.
- Documentation if any might need to be rewritten.
- Documentation examples might need to be automatically generated.
- Might need a lot of feedback from the comunity.
- Might depend on a proposed function of pgRouting
- Might depend on a deprecated function of pgRouting
Proposed functions¶
- Contraction - Reduce network size using contraction techniques
- pgr_contractGraph - Proposed - Reduce network size using contraction techniques
- Maximum Flow
- pgr_maxFlowPushRelabel Proposed - Maximum flow using push&relabel algorithm.
- pgr_maxFlowEdmondsKarp - Proposed - Maximum flow using Edmonds&Karp algorithm.
- pgr_maxFlowBoykovKolmogorov - Proposed - Maximum flow using Boykov&Kolmogorov algorithm.
- Applications of Maximum Flow
- pgr_maximumCardinalityMatching - Proposed - Calculates a maximum cardinality matching.
- pgr_edgeDisjointPaths - Proposed - Calculates edge disjoint paths.
- convenience
- pgr_pointToEdgeNode - Proposed - convert a point geometry to a vertex_id based on closest edge.
- pgr_pointsToVids - Proposed - convert an array of point geometries into vertex ids.
- graph analysis
- pgr_labelGraph - Proposed - Analyze / label subgraphs within a network
- Vehicle Routing Problems
- pgr_gsoc_vrppdtw - Proposed - VRP Pickup & Delivery (Euclidean)
- pgr_vrpOneDepot - Proposed - VRP One Depot