Is it possible to find the smallest distance between me and some User A?
Just imagine:
User A knows someone, who knows someone, who knows someone, ... who knows someone that knows User B.
And I know this user B.
Will the Facebook API allow me to find all these Facebook users between User A and User B?
Or will I have to write my own algorithm to find the shortest distance between me and User A?
Maybe that kind of algorithm already exists...
I can imagine:
If that kind of User B does not exists, then Facebook API or software which cares about this problem will take a long time and maybe it will crash the system.
If that kind of User B exist, then algorithm should also find another that kind of User B in order to compare and get the smallest distance between me and User A!
So how to solve this problem?
This is called degree of separation. With the current limitations in Facebook API v2.0 and above this will not be possible.