ANTAREX project

Part of EU Open Research Repository
Published June 15, 2018 | Version v1
Dataset Open

Road network graphs for betweenness centrality algorithm

Authors/Creators

  • 1. VSB - TU Ostrava, IT4Innovations

Contributors

Researcher:

  • 1. VSB - TU Ostrava, IT4Innovations

Description

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.

Archive contents
The archive contains following folders.

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

PT
Static graphs of Lisbon, Porto and entire Portugese road network. Weighted by length of the road segments in metres.

Data format
Standard UTF-8 encoded CSV files, separated by semicolon with the following columns:

id1: (Type: unsigned long) - start node
id2: (Type: unsigned long) - end node
dist: (Type: unsigned long) - weight of the edge (length in metres, unless described otherwise)
edge_id: (Type: unsigned long) - unique edge identifier



 

 

 

 

Files

Files (30.1 MB)

Name Size Download all
md5:bc5ddcf53b378d7535b76e397269a9f1
30.1 MB Download

Additional details

Funding

European Commission
ANTAREX - AutoTuning and Adaptivity appRoach for Energy efficient eXascale HPC systems 671623

References

  • Hanzelka, J., Skopal, R., Slaninová, K., Martinovič, J., & Dvorský, J. (2017). Graph Problems Performance Comparison Using Intel Xeon and Intel Xeon-Phi. In Advanced Computing and Systems for Security (pp. 73-83). Springer, Singapore.