AJ
BAN USER
Comments (2)
Reputation 0
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
1. best possible connections could be identified as sum of weights of all paths (connections) form a candidate person to the target person divided by number of paths.
a default weight of an edge may be assumed as one in this case, so for example- if a candidate vertices (person) is 2 vertices (person) away from target vertice then the sum of that connection is 2.
2. people with weight reduce the sum of each edge connected to them by a factor of their weights, ideally this would be a factor of weights of both sides of a given edge
3. influence of a person could be a function of sum strength of each connection (which may a function of frequency of contact, number of shared friends, duration of connection etc)
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
why is "left >= m" part necessary in the following check?
- AJ January 15, 2013