# pgRouting Manual (3.1)

## 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.

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

## See Also

Indices and tables

- Index

- Search Page