Servan42 / WikipediaSpeedrun

IPathFinderService A* Dijkstra

Functionalities

• Searches for the shortest link list between two specified wikipedia pages
• Specifies the number of clics required to get from the initial page to the arrival page.
• Only uses links within the article.

Client

Console application.

Inputs

• Prompts for initial page title.
• Prompts for arrival two title.

Output

Shortest path: X clics
InitialPageTitle -> Page1 -> ... -> PageN -> ... -> PageN-1 -> ArrivalPage 

External Documentation

https://www.redblobgames.com/pathfinding/a-star/introduction.html