Skip to main content

Path Finding - 0.1.1

A demo visualizing the execution of various path finding algorithms

Xueqiao Xu

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)



Updates: version 0.1.1 Feb 17 2011
Add: If client fails to connect to the server, it will continuously attemp to connect every 5 seconds. Related notification is also added.
Add: Window icons.
Fix: Asynchat related message queue issue.
Fix: Working directory related issue.
Chg: Refactored some codes, and added more documents and comments.


Home Page


Path Finding 0.1.0 — 12 Feb, 2011

Path Finding 0.1.1 — 16 Feb, 2011 account Comments

  • Zebra IPad 2011-05-02 11:18

    Good example.

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

    my saviour :)

  • Fabian 2020-10-16 14:35