FYI http://code.google.com/apis/opensocial/docs/0.8/reference/#opensocial.IdSpec.Field.NETWORK_DISTANCE
Hope it clears out your doubts. GB.- On Tue, Sep 2, 2008 at 11:10 AM, peeyush gulati <[EMAIL PROTECTED]> wrote: > Any update !!!!! > > ---------- Forwarded message ---------- > From: peeyush gulati <[EMAIL PROTECTED]> > Date: Sat, Aug 30, 2008 at 4:09 PM > Subject: Network Distance > To: [email protected] > Cc: peeyush gulati <[EMAIL PROTECTED]> > > > Hi All > > I was concerened about Network Distance feature of open social specification > 0.8 > > What i understand of network distance is the distance between 2 people in a > social networking. > > Lets say a case is there > > (A)--->(B) " ---> INDICATES FRIEND ' > (A)--->(C) > > (C)--->(D) > (C)--->(E) > > > (D)--->(E) > > the same has been shown in the diagram attached here. > > Now according to my understanding Network Distance between A & E = 2 and > also 3 when we take person D into the path. > > So do we give a priority to the lesser one. Or would this person D come up > in both the cases when finding people with network distance 2 or 3. > > > I believe Network distance is still not supported and updated into shindig. > Are we going to do the same in shindig release 1.0 or can we do it before. > Also please specify what algorithm we would follow in cases like above. > Implementing a algorith is not a big deal but i am skeptical about gadgets > whiich would fetch people with network distance 4,5 and above, keeping the > complexity of computation in place. > > > Please do correct if my understanding is wrong at any place. > > > Thanks and Regards > Peeyush > > > > > > > > -- > Thanks and Regards > Peeyush Gulati > +91-9916304135 > > > > -- > Thanks and Regards > Peeyush Gulati > +91-9916304135 > -- Guido Barosio ----------------------- http://www.globant.com [EMAIL PROTECTED]
