A web-app that finds the shortest path between two users on GitHub. This is based on the Six Degrees of Seperation theory.

Live demo: linked.wyu.app

The Six Degress of Seperation theory says that any two people in the world can be connected to each other using at most six social connections.

This app uses Bi-Directional Breadth-First Search to comb through two users' public followings/followers to find social connections at a maximum depth of 10.

Linked uses React + NextJS, and is deployed on Vercel. The project is licensed, see LICENSE.md.

• Git
• Node.js
• Playwright (Optional, see commands section)

Clone the repository to get the project onto your device.

git clone https://github.com/wyu4/linked.git

Then, install the project dependencies.

npm install

Create a copy of .env.example, replacing .example with .local, and fill the information in the file.

GITHUB_CLIENT_ID=0 # Your OAUTH app ID
GITHUB_CLIENT_SECRET=0 # Your OAUTH secret
BETTER_AUTH_SECRET=0 # Generate a secret using 'npm run generate'
BETTER_AUTH_URL=http://localhost:3000 # Change this to your base URL
NEXT_PUBLIC_MAX_DEPTH=5 # Change this to the max lookup depth for one direction of BFS
BFS

To run the project, run the development command.

npm run dev

This project also supports Playwright commands for testing purposes. Install using the npx command line.

npx playwright install

To use any of the following commands, first host the project locally on port 3000 using npm run dev on a seperate terminal.