Skip to main content

Dijkstra pathfinding with python.

I have a lot of half finished things floating around, here is one of them...

Been seeing the dijkstra algorithm around a bit lately, so I had a go at implementing it in Houdini.

http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm

Most of it is in python. ~2000 points and it cooks in about 1.2s so it isn't super slow...

Could probably be faster if I made it A* instead, but I have nothing to use it for so, meh!




hipnc is here.
you will need the otl here too

Comments

  1. Hello Sam,

    I'd love to get a look at the pathfinding files, but the links you supplied in the post don't seem to be active. Any chance you could help me get the files?

    Thanks in advance,
    Marein Könings

    ReplyDelete
  2. My domain expired :/ Should be back up in the next day, but I can email you the stuff if you give me your address :)

    ReplyDelete
  3. That would be great! Please send it to contact@myname.org, where myname is the name under which this comment is posted (without capitals). Measures to prevent spam and such... :)

    ReplyDelete

Post a Comment