CS225-Final-Project

How to execute code

1. Open project in container using dockerfile
2. Make new build folder with a new version mkdir build
3. In your terminal, move into the build folder cd build and then run cmake ..
4. Still in this directory, run make to compile the main and test executables
5. Run ./main to run the main executable
6. Run ./test to run the test executable

** When running the main executable, there is the opportunity to run 3 different algorithms in our NBA Player Graph **

** You can find the list of players to input in our graph in NBA_STATS_WITH_PER.csv located in the data folder **

BFS: Input 2 players that exists in the graph. You will receive a path of players that starts from first input to last input.

Dijkstra's: Input 2 players that exists in the graph that were teammates for a period of time. You will receive a path of players that starts from first input to last input with highest PER mutual teammates.

Fruchterman-Reingold Layout: Input a player that exists in the graph. You will receive a response that directs you to 2 images of the one depth player graph before and after algorithm runs.

before.png: https://github.com/daniyal-rana/CS225-Final-Project/blob/f795fadf9651656b4b24c705d9277c1fdd45f5b7/before.png

after.png: https://github.com/daniyal-rana/CS225-Final-Project/blob/d5c4727499f80ab01e238893b90cde6e63b78e3b/after.png

PlayerGraph class is found in the src folder: (https://github.com/daniyal-rana/CS225-Final-Project/tree/main/src)

Algorithms found in our PlayerGraph class: Fruchterman-Reingold Dijkstra's BFS

** Test cases for these algorithms are reproduced through ./test executable **

Data and Data parsing of our NBA dataset is found in the data folder. Data parsing test cases are found here: https://github.com/daniyal-rana/CS225-Final-Project/blob/f795fadf9651656b4b24c705d9277c1fdd45f5b7/data/dataset_test.ipynb

Presentation Video: https://mediaspace.illinois.edu/media/t/1_6bk1kda0