Chinese Postman Problem  Family of functions (Experimental)
Warning
Possible server crash
 These functions might create a server crash
Warning
Experimental 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 ANYINTEGER and ANYNUMERICAL
 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
Versions of this page
 Supported versions:
current(3.1)
3.0
Description
The main characteristics are:
 Process is done only on edges with positive costs.
 Running time: \(O(E * (E + V * logV))\)
 Graph must be connected.
Parameters
Column 
Type 
Default 
Description 
edges_sql 
TEXT 

The edges SQL query as described in Inner query. 
Inner query
An Edges SQL that represents a directed graph with the following columns
Column 
Type 
Default 
Description 
id 
ANYINTEGER 

Identifier of the edge. 
source 
ANYINTEGER 

Identifier of the first end point vertex of the edge. 
target 
ANYINTEGER 

Identifier of the second end point vertex of the edge. 
cost 
ANYNUMERICAL 

Weight of the edge (source, target)
 When negative: edge (source, target) does not exist, therefore it’s not part of the graph.

reverse_cost 
ANYNUMERICAL 
1 
Weight of the edge (target, source),
 When negative: edge (target, source) does not exist, therefore it’s not part of the graph.

Where:
ANYINTEGER:  SMALLINT, INTEGER, BIGINT 
ANYNUMERICAL:  SMALLINT, INTEGER, BIGINT, REAL, FLOAT 
See Also
Indices and tables