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.
Content © 2010 Bulgarian PostgreSQL User Group. All Rights Reserved.
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