Road network graphs for betweenness centrality algorithm
| Main Authors: | Jiří Hanzelka, Martin Golasowski, Kateřina Slaninová |
|---|---|
| Other Authors: | David Vojtek |
| Format: | info dataset Journal |
| Terbitan: |
, 2018
|
| Subjects: | |
| Online Access: |
https://zenodo.org/record/1290209 |
Daftar Isi:
- 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