# pgRouting Manual (3.3)

## Topology - Family of Functions

- Supported versions: Latest (3.3) 3.2 3.1 3.0

- Unsupported versions: 2.6 2.5 2.4 2.3 2.2 2.1 2.0

# Topology - Family of Functions

The pgRouting’s topology of a network, represented with an edge table with source and target attributes and a vertices table associated with it. Depending on the algorithm, you can create a topology or just reconstruct the vertices table, You can analyze the topology, We also provide a function to node an unoded network.

- pgr_createTopology - to create a topology based on the geometry.

- pgr_createVerticesTable - to reconstruct the vertices table based on the source and target information.

- pgr_analyzeGraph - to analyze the edges and vertices of the edge table.

- pgr_analyzeOneWay - to analyze directionality of the edges.

- pgr_nodeNetwork -to create nodes to a not noded edge table.

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_extractVertices – Proposed - Extracts vertices information based on the source and target.

## See Also

Indices and tables

- Index

- Search Page