A web application that compares Dijkstra's Algorithm and Breadth-first search for finding shortest paths between Twitter users in a social network graph.
TwitterTraverse visualizes and benchmarks path-finding algorithms on Twitter's social network. Enter two Twitter user IDs and see real-time performance metrics comparing how Dijkstra's and Breadth-first search algorithms find connections between users.
- Access this website: https://twitter-traverse.vercel.app/
- Click the "Try Random Connection" Button (Preset random pairs)
- Then Analyze Connection
- Download the file: backend/data/twitter_combined.txt
- Search for two nodes in the file.
- Access this website: https://twitter-traverse.vercel.app/
- Input the two nodes and check results
Navigate to backend directory
cd backend
Install dependencies
pip install flask flask_cors
Run the server
python app.py
Navigate to frontend directory
cd frontend
Install dependencies
npm install
Run development server
npm run dev
- React
- Next.js
- TypeScript
- TailwindCSS
- Vercel (deployment)
- Python
- Flask
- Flask-CORS
- Render (deployment)
- Stanford SNAP Twitter dataset
Developed by ThomSayEric:
- Eric Zhang
- Sayhan Khan
- Thomas Fitzpatrick