rome_roads — Rome road network (1999)
- Description
Directed road network covering a large part of the city of Rome, Italy, as of 1999. Nodes are road intersections, and a directed edge $(i,j)$ is a road or road segment along which one can drive from intersection $i$ to intersection $j$ (two-way roads appear as a pair of opposite edges); edges are weighted by their physical length. The network was contributed by G. Storchi, P. Dell'Olmo (University of Rome "La Sapienza") and M. Gentili (University of Salerno), and was distributed by the 9th DIMACS Implementation Challenge on shortest paths (2006) as one of its benchmark instances, in the challenge's graph format. The network contains a few parallel edges, which are kept as in the source file.
The edges have the property
distance, the length of the road segment, in meters.1
- Tags
- Transportation Roads Weighted Spatial
- Citation
-
- "9th DIMACS Implementation Challenge - Shortest Paths" (2006) web.archive.org
- Upstream URL OK
- https://web.archive.org/web/2019/http://www.dis.uniroma1.it/challenge9/download.shtml
- Networks
-
Tip: hover over a column header for a description.
Column legend
- $\left<k\right>$
- Mean degree
- $\sigma_k$
- Standard deviation of the degrees
- $\lambda_h$
- Largest eigenvalue of the Hashimoto (non-backtracking) matrix
- $\tau$
- Random walk mixing time
- $r$
- Degree assortativity
- $c$
- Global clustering coefficient
- $\oslash$
- (Pseudo-) diameter
- $S$
- Relative size of the largest component
- NPs
- Node properties
- EPs
- Edge properties