A couple of Sundays ago, I wrote an implementation of Dijkstra’s algorithm in Clojure . The core algorithm came to twenty-five lines. I banged out the code as I sat in a coffee shop with some other people from Hacker School . I ran my program on a data set that has two-hundred nodes in a densely interconnected graph. The program produced best paths from a start node to all other nodes in the graph in about 200 milliseconds. I closed my laptop, finished my peanut butter, banana and honey sandwich,
Read full article from The Fibonacci heap ruins my life at Mary Rose Cook
No comments:
Post a Comment