web.archive.org/web/20150927055944/http:/blog.linkedin.com/2008/09/19/implementing-di

Preview meta tags from the web.archive.org website.

Linked Hostnames

1

Thumbnail

Search Engine Appearance

Google

https://web.archive.org/web/20150927055944/http:/blog.linkedin.com/2008/09/19/implementing-di

Implementing Dijkstra’s Algorithm in Ruby

Recently in a LinkedIn LED hack day, I got a chance to play around with data to analyze the social graph. In order to compute some results in real-time, I needed an efficient way to find the shortest path between two nodes in a graph and Dijkstra's algorithm came to



Bing

Implementing Dijkstra’s Algorithm in Ruby

https://web.archive.org/web/20150927055944/http:/blog.linkedin.com/2008/09/19/implementing-di

Recently in a LinkedIn LED hack day, I got a chance to play around with data to analyze the social graph. In order to compute some results in real-time, I needed an efficient way to find the shortest path between two nodes in a graph and Dijkstra's algorithm came to



DuckDuckGo

https://web.archive.org/web/20150927055944/http:/blog.linkedin.com/2008/09/19/implementing-di

Implementing Dijkstra’s Algorithm in Ruby

Recently in a LinkedIn LED hack day, I got a chance to play around with data to analyze the social graph. In order to compute some results in real-time, I needed an efficient way to find the shortest path between two nodes in a graph and Dijkstra's algorithm came to

  • General Meta Tags

    6
    • title
      Implementing Dijkstra’s Algorithm in Ruby | Official LinkedIn Blog
    • Content-Type
      text/html; charset=UTF-8
    • pageKey
      ms_blog.linkedin.com_200_09_19_implementing-di
    • charset
      utf8
    • meta

  • Open Graph Meta Tags

    5
    • og:title
      Implementing Dijkstra’s Algorithm in Ruby
    • og:type
      article
    • og:description
      Recently in a LinkedIn LED hack day, I got a chance to play around with data to analyze the social graph. In order to compute some results in real-time, I needed an efficient way to find the shortest path between two nodes in a graph and Dijkstra's algorithm came to
    • og:url
      https://web.archive.org/web/20150905004025/http://blog.linkedin.com/2008/09/19/implementing-di/
    • og:image
      https://web.archive.org/web/20150905004025im_/http://blog.linkedin.com/wp-content/uploads/2012/11/JerryLuk.jpg

  • Link Tags

    10
    • EditURI
      http://blog.linkedin.com/xmlrpc.php?rsd
    • alternate
      https://web.archive.org/web/20150905004025/http://blog.linkedin.com/2008/09/19/implementing-di/feed/
    • canonical
      https://web.archive.org/web/20150905004025/http://blog.linkedin.com/2008/09/19/implementing-di/
    • shortcut icon
      https://web.archive.org/web/20150905004025im_/http://blog.linkedin.com/wp-content/themes/linkedin/images/favicon.ico
    • shortlink
      https://web.archive.org/web/20150905004025/http://blog.linkedin.com/?p=16

Links

25