Instructor: Suchetana Chakraborty
- Topic: Navigating Airports Using Graph Algorithms
- Mentor TAs:
- Jainan Nareshkumar Tandel (M23CSA010)
- Dhruv (B20EE016)
- Vishwjeetsinh Jadeja (B22MT023)
- Aaditya Kamble (B22MT024) - [email protected]
- Sahil (B22MT038)
- Ghanshyam Suthar (B22PH009)
GitHub Repo: ideathon-code-submission-b22mt024
- CSV Files:
airports_final.csv
: Contains all the airport information used as vertices.routes_final.csv
: Contains all the routes data used for making edges.
- C Code Files:
dijkstra.c
Bellman.c
floyd.c
- Other Files:
visualization.svg
: Shows the visualization of the graphs.Distance_matrix.txt
: Contains the output matrix given by the Floyd algorithm.timecomplexity.xlsx
: Contains all the results and graphs.DSAIdeathon.pptx
: Presentation.DSAIdeathon.pdf
: Presentation.
PPT Link: View Presentation
- Make sure that the two CSV files and the three code files are placed in the same folder.
- Open the command prompt in the folder where all the files are placed.
- Use the following commands to compile:
- Dijkstra:
gcc -w dijkstra.c -o dijkstra
- Bellman-Ford:
gcc -w Bellman.c -o bellman
- Floyd:
gcc -w floyd.c -o floyd
-w
flag while compiling to avoid any warnings. - Dijkstra:
- To execute the programs, use the following commands:
- Dijkstra:
./dijkstra
- Bellman-Ford:
./bellman
- Floyd:
./floyd
- Dijkstra:
- If you are using VS Code, you can run the following commands in the terminal:
- dijkstra.c:
./dijkstra
- Bellman.c:
./bellman
- floyd.c:
./floyd
- dijkstra.c:
- After executing, the program will ask for input and output IATA codes. You can refer to the CSV files for airport information. The routes CSV file contains information about the source and destination airports.
- Use the
visualization.svg
file to verify the output.
Note: Ensure that the -w
flag is included while compiling to avoid warnings.