Skip to main content

Path Finding

A demo visualizing the execution of various path finding algorithms


Xueqiao Xu
(qiao) 

This is a demo visualizing the execution of various path-finding algorithms
Curently five algorithms are included:
  1. A* (using Manhattan distance)
  2. A* (using Euclidean distance)
  3. A* (using Chebyshev distance)
  4. Dijkstra
  5. Bi-Directional Breadth-First-Search 
This is a Client/Server application. You should start the server first and then the client. 
Also, you can start the server on one machine and run the client on a different machine, as long as the two machines are connected.
Requires Python 2.6+ (2.5 and 3.x is not supported)
video:  http://www.youtube.com/watch?v=DINCL5cd_w0

Changes

pathfinding 16 astar 9 algorithm 7 bfs 1 dijkstra 1

Links

Home Page
http://code.google.com/p/mycodeplayground/

Releases

Path Finding 0.1.0 — 12 Feb, 2011

Path Finding 0.1.1 — 16 Feb, 2011

Pygame.org account Comments

  • Zebra IPad 2011-05-02 11:18:40

    Good example.

  • I Hate People 2016-07-03 00:33:27

    my saviour :)

  • Fabian 2020-10-16 14:35:20.938767

    dead