Finds the lowest number of links required to traverse two Wikipedia pages, using only the links found on the Wikipedia pages
- urllib module is required to use the program
- Input/Output will be done in the solver.py program
- You will be prompted to enter two Wikipedia pages
- note: there is also an option to use random pages by typing "r" in the input
- The program will search starting from the initial page to find the minimum amount of clicks required to reach the second Wikipedia page
- In the end, one result will be displayed as the shortest path
- note: There could be multiple cases with the same amount of clicks, but only one will be outputted