Path Finding - 0.1.1

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:

A* (using Manhattan distance)
A* (using Euclidean distance)
A* (using Chebyshev distance)
Dijkstra
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

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.