The technical problem to be solved (in easy words)
Posted by narres on June 10, 2006 at 8:31am
Finding out, how data is related to another one is easy to be represented as a "Model View Controller".
As an example: If relations between users are build through the buddy.module we know the direct relation between 2 users. What we want to figure out is the "shortest path" between 2 users, who are not buddied.
M: Array of known relations (optionally with weight)
V: Visualisation of the path like shown at http://sna.drupaler.net/?q=de/node/13
C: Dijkstra's algorithm for "Shortest Path"; http://sna.drupaler.net/?q=de/node/10 ; sna.module
If following relations-Model (with weights) exists:
Read moreSubscribe with RSS 