A shortest path algorithm for grid graphs
From MaRDI portal
Publication:4143183
DOI10.1002/net.3230070404zbMath0366.94039OpenAlexW2006385089MaRDI QIDQ4143183
Publication date: 1977
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230070404
Related Items (3)
On graphs preserving rectilinear shortest paths in the presence of obstacles ⋮ Rectilinear paths among rectilinear obstacles ⋮ A shortest-path algorithm for Manhattan graphs
Cites Work
This page was built for publication: A shortest path algorithm for grid graphs