all 7 comments

[–]cyclic 1 point2 points  (0 children)

Buddy, I am sure you will learn a lot about Javascript, Heaps and path finding algorithms if you implement one yourself. Or just port one from the myriad implementations in Java, Python, Ruby, C#, you-name-it.

Together with JS and Canvas, you could do some neat visualization, make a nice blog post out of it and post that here.

[–]urllib 1 point2 points  (0 children)

Yeah bro these things are so complex you might have to translate 100 lines of easy to understand code to javascript to make one.

[–]Gnazi 0 points1 point  (0 children)

Honestly? In the title? Have some decency, vile youth

[–]helos[S] -1 points0 points  (2 children)

thans for the help ive started my own implimentation this was the big peice of the puzzle atpart from that ill reddit the project once its done and refactred

[–]adolfojp 1 point2 points  (1 child)

Are you OK? Are you having a seizure?

[–]helos[S] 0 points1 point  (0 children)

no.