everystreet
everystreet is an algorithm and web application that finds an optimal route covering every street in a given city or neighborhood. Inspired by the everystreet challenge, which involves running or cycling along every single street of an area, the project tackles this as the Chinese Postman Problem, also known as the Route Inspection Problem, seeking the shortest closed path that visits every edge of a street network graph. The software uses Open Street Map data via the OSMnx library to retrieve street networks, applying custom filters to exclude highways, pedestrian paths, and restricted roads. It converts directed graphs to undirected ones, finds nodes with odd degree, computes shortest distances between them, creates a complete weighted graph, finds a minimum weight matching, and finally generates an Eulerian circuit using Hierholzer algorithm, as proposed by Edmonds and Johnson. Key features include map data retrieval through OSMnx, graph simplification by ignoring one-way street direction, and an included