Home

Graph analysis on a transportation network

See this detailed guide containing an example script explaining how to use GDMS-Topology to calculate betweenness and closeness centrality on a transportation network.

Supported functions

As of now, GDMS-Topology supports the following SQL functions:

• ST_Graph - Constructs a mathematical graph based on the data contained in the input table.
• ST_ConnectedComponents - Calculates the connected components of a given graph.
• ST_ShortestPath - Calculates the shortest path between two vertices of a graph using Dijkstra's algorithm.
• ST_BlockIdentity - Aggregates geometries by blocks determined by a spatial predicate.
• ST_FindReachableEdges
• ST_MFindReachableEdges
• ST_MShortestPath
• ST_MShortestPathLength
• ST_PlanarGraph
• ST_ShortestPathLength
• ST_SubGraphStatistics
• ST_ToLineNoder