Team Size -- 3
Individual Role -- Programmer
Software & Languages -- Visual Studio; C++
Wikispeedia, also known as The Wikipedia Game, asks a user to go from one random Wikipedia article to another using only the hyperlinks within each article, and the fewest clicks wins. So, if someone were to take a subset of Wikipedia, the easiest model is a graph. And what do you do with that graph? You run algorithms on it to see what you can find. Armed with some data structure knowledge, C++, a pair of team members and deadlines, that is exactly what I got to do: make the computer play Wikispeedia.
Compiled by the Stanford Network Analysis Program (SNAP), we started with over 4,600 articles totaling nearly 120,000 different hyperlinks.
C++ allows the computer to neatly generate a list of vertices (articles) and edges (links). An adjacency list provides quick access when finding adjacent articles.
The end result is a mirror of the Wikispeedia game. The computer can quickly find a path between two articles and determine the shortest path between them. Going into the actual Wikispeedia game proves that the computer's route works perfectly.