News for hackers. Stuff that matters.
Re:Ditching Go for Node.js by todd8 on Thursday November 23, 2017 @12:53PM (#15766690)
A fully connected graph of n users contains n*(n-1) links if users don't connect to themselves (I would describe this as polynomial growth in the number of channels, a lot better than exponential). A chat broker that acts as a switchboard between users could, I suppose, reduce this to a linear relationship between users and channels.
Re:Ditching Go for Node.js by amelius on Thursday November 23, 2017 @02:07PM (#15767157)
You have to divide that by 2. It's "half the matrix".
Re:Ditching Go for Node.js by todd8 on Saturday November 25, 2017 @09:48AM (#15776147)
Thanks, my mistake. You're right, there are n(n-1)/2 arcs in the fully connected graph (K_n).
Re:Ditching Go for Node.js by adamweston on Thursday November 23, 2017 @01:55PM (#15767096)
Like a bus?