The program aims to find book with certain tag in the library at minimum distance from the user. Entire code is written in C with all implementations done from scratch including those for Graph and Heaps.
To run the program follow the steps:
- Run the command
gcc main.c -o main - Run the command
main - Enter the no of halls
- Enter the no of connection
- Enter three space seperated value each denoting (source, destination, distance) to describe the layout of the library
- Enter space separated strings for each hall in each line
- Enter the current hall id (1,2,..,n)
- Enter a string denoting the string you are searching for
- The required output will be generated
