This year's algorithm uses a Hamiltonian-cycle based approach to finding valid angel-mortal chains. Critically, networkx was used for graph algorithms.
- Clone the repo
- Create a virtual environment so that the required libraries don't pollute your namespace (Optional). Run
virtualenv venvin the cloned directory. - Install requirements with
pip install -r requirements.txt - Put a header-less tsv file (no column names, the first row is the first row of data already) with all details of participants in correct order in a file called
playerlist.tsvin the main folder. - Run
python angel.py
The columns in playerlist.tsv should be arranged as such, with 1 being the leftmost column. Important columns for matching: 2, 4, 7, 9, 10.
- Timestamp
- Full Name
- Facebook Name (if different)
- Floor Number
- Room Number
- Contact Number
- Gender
- Year of Study
- What's your gender preference for your Angel and Mortal?
- Faculty
- Interests
- Is there anything that you'd like us to know?