Reading about Dijkstra's algorithm for pathfinding, I see that every example applicable to a "grid based" game is related to the case in which you have a "cell" that is passable or not passable. I better examplain with an image:Reading about Dijkstra's algorithm for pathfind
阅读背景：
这个网格实现中的PathFinding算法
来源：互联网
分享到：
