Road network graphs for betweenness centrality algorithm

<p>Weighted graph representation of a road network&nbsp;in selected regions. Derived from Open Street Map&nbsp;<a href="https://www.openstreetmap.org/#map=8/49.817/15.478">https://www.openstreetmap.org</a>. The dataset can be used as input for&nbsp;the betweenness centrality algorithm implemented here:&nbsp;<a href="https://code.it4i.cz/ADAS/betweenness">https://code.it4i.cz/ADAS/betweenness</a>.</p> <p><strong>Archive contents</strong><br> The archive contains following folders.</p> <p><strong>CZE</strong><br> Static graphs of three major cities in the Czech Republic (Praha, Brno, Ostrava) and entire Czech road network.&nbsp;Weighted by length of the road segments in metres.</p> <p><strong>PT</strong><br> Static graphs of Lisbon, Porto and entire Portugese road network.&nbsp;Weighted by length of the road segments in metres.</p> <p><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:&nbsp;(Type: unsigned long) - </em>end&nbsp;node<br> <em>dist: (Type: unsigned long) - </em>weight of the edge (length in metres, unless described otherwise)<br> <em>edge_id:&nbsp;(Type: unsigned long) - </em>unique edge identifier<br> <br> <br> <br> &nbsp;</p> <p>&nbsp;</p> <p>&nbsp;</p> <p>&nbsp;</p>