Coloring - 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 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
pgr_sequentialVertexColoring - Experimental - Vertex coloring algorithm using greedy approach.
pgr_bipartite -Experimental - Bipartite graph algorithm using a DFS-based coloring approach.
Parameters¶
Parameter |
Type |
Description |
---|---|---|
Edges SQL |
|
Inner query as described below. |
Inner query¶
- Edges SQL
an SQL query of an undirected graph, which should return a set of rows with the following columns:
Column |
Type |
Default |
Description |
---|---|---|---|
id |
|
Identifier of the edge. |
|
source |
|
Identifier of the first end point vertex of the edge. |
|
target |
|
Identifier of the second end point vertex of the edge. |
|
cost |
|
|
|
reverse_cost |
|
-1 |
|
Where:
- ANY-INTEGER
SMALLINT, INTEGER, BIGINT
- ANY-NUMERICAL
SMALLINT, INTEGER, BIGINT, REAL, FLOAT
Result Columns¶
Returns SET OF (vertex_id, color_id)
Column |
Type |
Description |
---|---|---|
vertex_id |
|
Identifier of the vertex. |
color_id |
|
Identifier of the color of the vertex.
|
See Also¶
Indices and tables