Skip to content

Find the shortest path between two Wikipedia articles using breadth-first search.

License

Notifications You must be signed in to change notification settings

giovanni-cutri/wikipedia-connections

Repository files navigation

Wikipedia Connections

Find the shortest path between two Wikipedia articles using the breadth-first search algorithm.

Inspired by this CS50 Project.

Usage

  • Clone this repository to your local machine.

  • Ensure that you have installed Python.

  • Install the dependencies listed in requirements.txt.

    pip install -r requirements.txt
    
  • Run wikipedia_connections.py.

You will be prompted to provide the language of the Wikipedia edition you want to use, the title (or URL) of the initial article and the title (or URL) of the final article.

Alternatively, you can provide the aforementioned information as three command-line arguments, like this:

python wikipedia_connections.py [language] [initial_article] [final_article]

License

This project is licensed under the MIT License - see the LICENSE file for details.

About

Find the shortest path between two Wikipedia articles using breadth-first search.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages