progress made:
-
Created code that reads from the .dat files from the dataset and catgorize them into vectors in main.cpp (data acquisition and cleaning).
-
Created Airport class that holds the airports' names, ID, Latitude and Longitude in Airport.cpp and Airport.h.
-
Created Route class that stores the ID of source and destination airports of the routes from the dataset. It contains a method that computes the distance between airports for weights in our graph.
-
Created code that implements an adjacency matrix in main.cpp to aid our graph algorithm, with weight of the edges created from source and destination ID(the distance between airports) filling the corresponding positions.
-
Created Makefile that compiles and test our code.
-
Created and tested breath first traversal algorithm (implemented through adjacency matrix)
-
Created and tested dijkstra's algorithm (implemented also through adjacency matrix)
-
Finished test cases for Breadth First Traversal and Djikstra's Algorithm
-
Finished code implementation and test cases for Betweenness Centrality Algorithm
-
Started Code implementation for visual implementation
-
Finished Code Implementation for visual implementation
-
Re-orginized main for better demo experience
-
Fixed bugs on Betweeness Centrality and made concatenated connected component matrix to demo