Therefore, the Euclidean shortest path problem may be decomposed into two simpler subproblems: constructing the visibility graph, and applying a shortest path algorithm such as Dijkstra's algorithm to the graph.
Graph of a function | graph | Bipartite graph | planar graph | graph theory | High-visibility clothing | directed graph | Under Graph | random graph | Planar graph | Graph traversal | Graph theory | Graph (mathematics) | Gabriel graph | visibility graph | Unit distance graph | rook's graph | Rado graph | minor (graph theory) | Lattice graph | interval graph | In good visibility Queen's Park affords views of the Campsie Fells | Graph-tool | Graph (data structure) | Graph coloring | graph coloring | Graph | Factor graph | Exponential random graph models | Directed graph |
There have also been moves to return to combine space syntax with more traditional transport engineering models, using intersections as nodes and constructing visibility graphs to link them by various researchers, including Bin Jiang, Valerio Cutini and Mike Batty.