Graph search is a family of related algorithms. There are lots of variants of the algorithms, and lots of variants in implementation. Treat the code on this page as a starting point, not as a final version of the algorithm that works for all situations.
Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Generic
%1 patel2014implementation
%A Patel, Armit
%D 2014
%I Red Blob Games
%K a-star algorithm bfs breadth-first-search c computer-science cpp dijkstra early-exit find graph path pathfinding pi3-prog-report programming python search
%T Implementation of A*
%U https://www.redblobgames.com/pathfinding/a-star/implementation.html
%X Graph search is a family of related algorithms. There are lots of variants of the algorithms, and lots of variants in implementation. Treat the code on this page as a starting point, not as a final version of the algorithm that works for all situations.
@electronic{patel2014implementation,
abstract = {Graph search is a family of related algorithms. There are lots of variants of the algorithms, and lots of variants in implementation. Treat the code on this page as a starting point, not as a final version of the algorithm that works for all situations.},
added-at = {2020-06-16T07:28:07.000+0200},
author = {Patel, Armit},
biburl = {https://www.bibsonomy.org/bibtex/27c94b3f74ad21320b6b97c77d1edeacd/jpmor},
day = 06,
interhash = {e7bc9f56ba903122383e47dad2775d55},
intrahash = {7c94b3f74ad21320b6b97c77d1edeacd},
keywords = {a-star algorithm bfs breadth-first-search c computer-science cpp dijkstra early-exit find graph path pathfinding pi3-prog-report programming python search},
language = {en},
month = {07},
publisher = {Red Blob Games},
timestamp = {2020-10-07T13:36:50.000+0200},
title = {Implementation of A*},
url = {https://www.redblobgames.com/pathfinding/a-star/implementation.html},
urldate = {2020-06-16},
year = 2014
}