Link Details

Link 914987 thumbnail
User 1059807 avatar

By acoin
via architects.dzone.com
Published: Jan 30 2013 / 10:03

I recently wrote about an implementation of the Bellman Ford shortest path algorithm. I came across a suggestion that the algorithm would run much more quickly if we used vectorization with numpy rather than nested for loops.
  • 7
  • 0
  • 397
  • 496

Add your comment


Html tags not supported. Reply is editable for 5 minutes. Use [code lang="java|ruby|sql|css|xml"][/code] to post code snippets.

Voters For This Link (7)



Voters Against This Link (0)



    Apache Hadoop
    Written by: Piotr Krewski
    Featured Refcardz: Top Refcardz:
    1. Play
    2. Akka
    3. Design Patterns
    4. OO JS
    5. Cont. Delivery
    1. Play
    2. Java Performance
    3. Akka
    4. REST
    5. Java