%0 Generic %1 patel2014grids %A Patel, Armit %D 2014 %I Red Blob Games %K computer-science directed find graph grid mathematics multigraph obstacle path pathfinding pi3-prog-report undirected %T Grids and Graphs %U https://www.redblobgames.com/pathfinding/grids/graphs.html %X Graph search algorithms like Dijkstra’s Algorithm and A* work on weighted directed graphs, sets of nodes connected by edges that have numeric weights (movement costs) attached to them. Can they also work on grids? Yes: a grid can be viewed as a special case of a graph.

@electronic{patel2014grids, abstract = {Graph search algorithms like Dijkstra’s Algorithm and A* work on weighted directed graphs, sets of nodes connected by edges that have numeric weights (movement costs) attached to them. Can they also work on grids? Yes: a grid can be viewed as a special case of a graph.}, added-at = {2020-06-16T07:34:21.000+0200}, author = {Patel, Armit}, biburl = {https://www.bibsonomy.org/bibtex/2bed31d7f8b6ae89d5efe2ebcfea0317b/jpmor}, interhash = {eed77cff0079c6705c522cd9c27fd747}, intrahash = {bed31d7f8b6ae89d5efe2ebcfea0317b}, keywords = {computer-science directed find graph grid mathematics multigraph obstacle path pathfinding pi3-prog-report undirected}, language = {en}, publisher = {Red Blob Games}, timestamp = {2020-10-07T13:36:50.000+0200}, title = {Grids and Graphs}, url = {https://www.redblobgames.com/pathfinding/grids/graphs.html}, urldate = {2020-06-16}, year = 2014 }