GitHub / chergik / wsdot-kd-tree-connector

The sidewalks data is dirty in a sence of crosswalks being represented by the adjacent sections, which almost never end/start at the same point and cannot be used to build a directed graph (which later could have being used to build shortest paths using preferably Dijkstra or Belman-Ford).

JSON API: https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/chergik%2Fwsdot-kd-tree-connector

Files

Dependencies