US Highway Network Structure Analysis

Modeled the US highway system as a graph — states as nodes, highways as edges — and used Rust to compute which states are most critical to national connectivity.

Two metrics were applied: degree centrality (how many direct highway links a state has) and closeness centrality (how efficiently a state can reach every other state). North Carolina ranked highest for direct connections with 49 links, while Missouri topped overall network centrality.

Built using the petgraph library with Dijkstra's algorithm for shortest-path calculations. Raw highway data was sourced from Kaggle, filtered to remove decommissioned routes, and processed into ranked CSV outputs.