« New tool for autoparallelism
BibTeX is now running… »

Dijkstra’s shortest path in momo!

Well, I’ve been coding for some hours now, fiddling around with implementing Dijkstra’s shortest path algorithm in momo.

I like it as it is right now, but due to our unfinished compiler, I can’t promise that it does’t contain errors :)

Also, I think we need a long talk about reference vs value representation of all of our types.

Check out the implementation here: ShortestPath.momo

Explore posts in the same categories: Languages & Compilers

This entry was posted on April 23, 2007 at 14:00 and is filed under Languages & Compilers. You can subscribe via RSS 2.0 feed to this post's comments. You can comment below, or link to this permanent URL from your own site.

One Comment on “Dijkstra’s shortest path in momo!”

  1. markfoged Says:

    April 23, 2007 at 14:03

    I already spotted an error in the mainscope, but anyway…

    The implementation can also be found on the SVN in the Debugfolder of our compiler :)


Comment:

You must be logged in to post a comment.