//! Planar road graph in half-edge / DCEL form (spec §2.3).
//!
//! Nodes are intersections; roads are straight edges between two
//! nodes. Each road is represented internally by two opposing
//! half-edges. Blocks are the bounded faces of this graph.
//!
//! Stable IDs are minted by `slotmap` so that the same node, road, or
//! parcel survives unrelated insertions and deletions (D3).

pub mod blocks;
pub mod graph;

pub use blocks::Block;
pub use graph::{NodeId, RoadGraph, RoadId};
