Python Script to detect the fastest way between a start and end Wikipedia article.
KevinBacon is a Python script designed to find the shortest path between two Wikipedia articles. It uses the Wikipedia API to travel through links and determine the quickest route from the starting article to the destination article.
- Pathfinding between Wikipedia articles
- Skips unnecessary categories and pages (e.g., "Help:", "Wikipedia:")
- Clone the repository:
git clone https://github.com/ArchooD2/KevinBacon.git
- Navigate to the project directory:
cd KevinBacon - a. Run the script:
b. Run the GUIscript:
python baconwaffle.py "start article" "end article" "depth"
python bacongui.py
This script uses a breadth-first search (BFS) algorithm to find the shortest path between Wikipedia articles.
I want this to be optimized, so any suggestions or contributions to enhance the performance and efficiency of the script (or new scripts) are welcome! See the CONTRIBUTING.md file for detailed guidelines on how to contribute.
This project is open for public use. Feel free to fork the repository, make improvements, and submit pull requests. If you use this in a project, just credit me somewhere!
This project is licensed under the GPLv3.0 License. See the LICENSE file for details.
If you have any questions or suggestions, please open an Issue!
Thank you for checking out KevinBacon! Happy pathfinding!