This article explains the basic implementation in length: The goal of this blog post is to show the fundamentals of A* through a really simple C# implementation. It also points to better implementations, more suitable for production use: As for ways to find better routes, there are plenty of C# examples around that are far … Read more
Dijkstra is a special case for A* (when the heuristics is zero).
your image is like 2d grid map But your text suggest graph approach which is a bit confusing. For 2D grid map the costs must be different between cells on path You got too much of cost=100 in there and therefore you can not backtrack the path. You have to increase or decrease cost on … Read more
Was curious so I tested mine A* and here is mine result Maze 1280 x 800 x 32 bit pixels as you can see it took ~23ms no multithreading (AMD 3.2GHz) C++ 32bit app (BDS2006 Turbo C++ or Borland C++ builder 2006 if you like) the slowest path I found was ~44ms (fill almost whole … Read more