Floyd-Warshal algorithm in PL/pgSQL

Posted by Ivan / on 01/30/2009 / 1 Comment

Maresa Nirwan has published a interesting blog post in which she implemented the Floyd-Warshal algorithm in pl/pgsql. The Floyd-Warshal deals with the degrees of separation in social networks. In other words it calculates the the shortest paths between all pairs of vertices in a graph.

 

RSS Feed for this Blog    Comments Feed for this Post   

Comments

  • IVO says:

    Тези ресурси също биха били полезни:
    1. http://www.cartoweb.org/doc_head/docbook/xhtml/user.routing.html
    2. http://phenomics.cs.ucla.edu/PostGraph/

    January 30, 2009 at 8:13 PM | Permalink

 

Join this Group Now!

Forgot Password?

Bulgarian PostgreSQL User Group
Powered by Groupsite.com

Visibility Limited Membership By Invitation or Approved Request Default Profile Professional

Your Status Not Logged-In