Presentation Video • Data • Repo Structure • Running Instructions • Team
We are using the Stanford Large Network Dataset Collection data and focusing on the following file:
-
All major files that contain our functions and classes are in
/code. -
Datasets are stored as txt files in
/data. -
Tests are in
/code/tests. -
Our development log, contract, and proposal are in
/documents. -
Our final report and presentation link are in
/final
Make sure you are running the program in Docker. If not, follow This Guide to get started.
To use our program, run make then ./main in the root directory. Follow the instructions of our program and you are all set!
We call all the functions in main.cpp for you, with clear prompts on what inputs to use. The required inputs for each of the functionality are as follows:
- BFS:
- Input: Starting user ID (between 0 and 4038)
- Output: The distance from this user's ID to the "root" user ID in the data set
- Prim's MST:
- Input: Starting user ID (between 0 and 4038)
- Output: The spanning tree of the graph with this starting node (this user's "friend circle")!
- A* Search:
- Input: Two user ID's (between 0 and 4038)
- Output: The "path" between these two users- how many degrees they are separated by!
To run the test cases, run make tests then ./tests in the main directory.
We constructed many small to medium sized datasets in /tests directory, which are used as test cases to evaluate if the output of our algorithms are as expected. Our tests focus on testing the functionality of the graph construction as an adjacency matrix, Prim's Algorithm, BFS Traversal, and A* algorithm.
- Neeya Devanagondi (
neeyati2) - Rucha Nandha (
rnandha2) - Ojaswee Choudhary (
ojaswee2) - Ria Desai (
rndesai2)