 roadNet-PA.txt.gz |
9.95MB |
Tags: graph
From http://snap.stanford.edu/data/roadNet-PA.html
Dataset information
This is a road network of Pennsylvania. Intersections and endpoints are represented by nodes, and the roads connecting these intersections or endpoints are represented by undirected edges.
Dataset statistics
Nodes: 1088092 Edges: 1541898 Nodes in largest WCC: 1087562 (1.000) Edges in largest WCC: 1541514 (1.000) Nodes in largest SCC: 1087562 (1.000) Edges in largest SCC: 1541514 (1.000) Average clustering coefficient: 0.0465 Number of triangles: 67150 Fraction of closed triangles: 0.02062 Diameter (longest shortest path): 786 90-percentile effective diameter: 5.3e+02
Source (citation)
J. Leskovec, K. Lang, A. Dasgupta, M. Mahoney. Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters. Internet Mathematics 6(1) 29--123, 2009.
License: No license specified, the work may be protected by copyright.
Bibtex:
@article{,
title= {Pennsylvania Road Network},
keywords= {graph},
journal= {},
author= {Jure Leskovec and Andrej Krevl},
year= {},
url= {},
license= {},
abstract= {From http://snap.stanford.edu/data/roadNet-PA.html
Dataset information
This is a road network of Pennsylvania. Intersections and endpoints are represented by nodes, and the roads connecting these intersections or endpoints are represented by undirected edges.
Dataset statistics
Nodes: 1088092
Edges: 1541898
Nodes in largest WCC: 1087562 (1.000)
Edges in largest WCC: 1541514 (1.000)
Nodes in largest SCC: 1087562 (1.000)
Edges in largest SCC: 1541514 (1.000)
Average clustering coefficient: 0.0465
Number of triangles: 67150
Fraction of closed triangles: 0.02062
Diameter (longest shortest path): 786
90-percentile effective diameter: 5.3e+02
Source (citation)
J. Leskovec, K. Lang, A. Dasgupta, M. Mahoney. Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters. Internet Mathematics 6(1) 29--123, 2009.},
superseded= {},
terms= {}
}
