Path Finding Algorithms (A*, Dijkstra, Bi-Directional BFS)

This is a demo of path finding using various algorithm.
It's written in Python, using the Pygame library. Meanwhile, it's a C/S application.
The executable and source can be found at
http://code.google.com/p/mycodeplayground/downloads/list

A javascript version, including an online demo, can be found at http://qiao.github.com/PathFinding.js/visual/

Category:

Science & Technology

Tags:

• Python
• Pygame
• A*
• Dijkstra
• Algorithm
• Path-finding
• Demo

[Funtasmia]

I cant get your program to work, it keeps saying that it cant connect to the server. (I did start server.exe!)

[XueqiaoXu]

@Funtasmia I ported this demo into an online version. You may check it out at qiao.github.com/PathFinding.js­/visual/

[lyndonarmitage]

Very good example of lots of pathfinding techniques :D Hadn't seen Bidirectional BFS before, nor one of the A* Heuristics :D

[TheQar3a]

Viva open source

[korostelevm]

Excellent !



[TarousDT]

That was neat.

[Funtasmia]

@XueqiaoXu yay!

[mbsalto]

@Funtasmia Actually I tested with several configurations and its allways slower

[Funtasmia]

@mbsalto There isnt really an "ultimate" algo, it is always depends on the current situation =P

[mbsalto]

So  Dijstra is a quite bad algorithm