Coloring - Family of functions¶
Proposed
Warning
Proposed functions for next mayor release.
They are not officially in the current release.
They will likely officially be part of the next mayor release:
The functions make use of ANY-INTEGER and ANY-NUMERICAL
Name might not change. (But still can)
Signature might not change. (But still can)
Functionality might not change. (But still can)
pgTap tests have being done. But might need more.
Documentation might need refinement.
pgr_sequentialVertexColoring - Proposed - Vertex coloring algorithm using greedy approach.
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_bipartite -Experimental - Bipartite graph algorithm using a DFS-based coloring approach.
pgr_edgeColoring - Experimental - Edge Coloring algorithm using Vizing’s theorem.
Result Columns¶
Returns SET OF (vertex_id, color_id)
Column |
Type |
Description |
---|---|---|
|
|
Identifier of the vertex. |
|
|
Identifier of the color of the vertex.
|
Returns SET OF (edge_id, color_id)
Column |
Type |
Description |
---|---|---|
|
|
Identifier of the edge. |
|
|
Identifier of the color of the edge.
|
See Also¶
Indices and tables