{"version":"1.0","type":"link","title":"Shortest-path graph - Newikis","description":"In mathematics and geographic information science, a shortest-path graph is an undirected graph defined from a set of points in the Euclidean plane. The shortest-path graph is proposed with the idea of inferring edges between a point set such that the shortest path taken over the inferred edges…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/7/7f/Lake_Michigan_Shortest_Path_Graph_t%3D2.svg/1280px-Lake_Michigan_Shortest_Path_Graph_t%3D2.svg.png","thumbnail_width":1280,"thumbnail_height":1752}