Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses

Re^3: OT(ish) - Best Search Algorithm

by Corion (Pope)
on Oct 15, 2007 at 11:01 UTC ( #644886=note: print w/replies, xml ) Need Help??

in reply to Re^2: OT(ish) - Best Search Algorithm
in thread OT(ish) - Best Search Algorithm

Your example still fits with my (tentative) definition. For both circles, it is true that each member has exactly two friendship relations in it. My definition does not say anything about the number of overall friendship relations on the whole site, but only about friendship relations within a circle.

But I think I need a second thing in the definition, but I'm not sure which one is "better":

  • A "circle of friends" must have at least three members
  • There must be at least one person for every member of the circle without a direct "friend" relation

The two are not equivalent, because the first rule allows circles of three persons, while the latter allows circles starting at four members.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://644886]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (15)
As of 2018-10-19 17:52 GMT
Find Nodes?
    Voting Booth?
    When I need money for a bigger acquisition, I usually ...

    Results (110 votes). Check out past polls.