In OSM maps not all intersections are properly marked (even though streets overlap - see e.g. a map of La Plata, Argentina). We should add missing intersections by comparing street segments against each other. Note that this will require some computations and brute-forcing it wuould easily yield O(n²) (with n == number of nodes in the entire graph). See e.g. https://www.topcoder.com/community/data-science/data-science-tutorials/line-sweep-algorithms/ and http://www.geeksforgeeks.org/given-a-set-of-line-segments-find-if-any-two-segments-intersect/
In OSM maps not all intersections are properly marked (even though streets overlap - see e.g. a map of La Plata, Argentina). We should add missing intersections by comparing street segments against each other. Note that this will require some computations and brute-forcing it wuould easily yield O(n²) (with n == number of nodes in the entire graph). See e.g. https://www.topcoder.com/community/data-science/data-science-tutorials/line-sweep-algorithms/ and http://www.geeksforgeeks.org/given-a-set-of-line-segments-find-if-any-two-segments-intersect/