Road Network Graphs For Betweenness Centrality Algorithm

Weighted graph representation of a road network in selected regions. Derived from Open Street Map https://www.openstreetmap.org. The dataset can be used as input for the betweenness centrality algorithm implemented here: https://code.it4i.cz/ADAS/betweenness. <strong>Archive contents</strong><br> The archive contains following folders. <strong>CZE</strong><br> Static graphs of three major cities in the Czech Republic (Praha, Brno, Ostrava) and entire Czech road network. Weighted by length of the road segments in metres. <strong>PT</strong><br> Static graphs of Lisbon, Porto and entire Portugese road network. Weighted by length of the road segments in metres. <strong>Data format</strong><br> Standard UTF-8 encoded CSV files, separated by semicolon with the following columns:<br> <br> <em>id1: (Type: unsigned long) - </em>start node<br> <em>id2: (Type: unsigned long) - </em>end node<br> <em>dist: (Type: unsigned long) - </em>weight of the edge (length in metres, unless described otherwise)<br> <em>edge_id: (Type: unsigned long) - </em>unique edge identifier<br> <br> <br> <br>