README

This project is using the Catalogue of Life dataset, with over 2.3 million species. The main data structure is built on a graph that is bidirectional, and calculates its own depth.
The main goal is to find the relatedness between two different species, output the path between them, and compare BFS and DFS when searching for a common ancestor.
https://docs.google.com/document/d/1Hc2h5f5hf40UH2znodt9OwZI2CivA82ZOyT6q0ecwaE/edit?usp=sharing

Usage:
Clone to make sure the tsv are installed properly, otherwise download here: https://drive.google.com/drive/folders/1EoXUhYoT98MNpYTP3l9lG752HALaDImx?usp=sharing
git lfs install
git clone https://github.com/tabbz-88/project2_3530
launch using CMake, make sure it is using the right directory* and C++ 11.
goto localhost:8080

You can also build it normally and use commandline:
g++ main.cpp Taxon.cpp Load.cpp -o relation
run relation.exe

*In Clion, Edit Configurations to where the directory is, so the tsv files are properly loaded.

Wait for the program to load the datasets and depth.
Input species 1 and species 2 or common names. When putting common names, you have to be specific, i.e. "Trout" may be a synonymous name for another animal, so be specific, like "Steelhead trout"
It should return the relatedness percentage, the path, and the common ancestor.

Documentation for the dataset:
https://www.checklistbank.org/about/formats#data-content
https://catalogueoflife.github.io/coldp/

Documentation for search implementation (basically the same as BST, but in graph format):
https://www.geeksforgeeks.org/dsa/graph-data-structure-and-algorithms/
https://www.geeksforgeeks.org/dsa/breadth-first-search-or-bfs-for-a-graph/
https://www.geeksforgeeks.org/dsa/depth-first-search-or-dfs-for-a-graph/

Github page for cpp-httplib:
https://github.com/yhirose/cpp-httplib/tree/master

* I am using VSCode and Windows, Clion should work a lot better.