This project is an attempt to implement the Six degrees of separation theory.
The Six degrees of separation idea asserts that anybody in the world can be reached within 6 or fewer connections.
The project is based on Steam friends, but can easily be adapted to another social platform.
In order to use this program, you need :
- A Steam API key, retrievable here
- A starting point which is represented by a user's Steam ID
- A user to reach, based on his Steam ID
go build
./handshake --key=<Api Key> --from=<Steam ID> --to=<Steam ID> --depth=<Maximum depth, default is 6>
The program will then output diverse data while doing its work.
In the end, if a user is reached, the chain of handshakes will be displayed.
For the moment, the implementation is quite slow and memory consuming, especially for deep relations (> 3, 4).
I'm planning on improving the algorithm & data structure used to address this issue.