2. Interacting with A$\lambda$goVista

AlgoVista.cs.arizona.edu.">A$\lambda$goVista is an online database that stores and codifies problems, algorithms, and combinatorial structures developed within the Computer Science theory community. An applied computer scientist will typically interact with A$\lambda$goVista by providing input $\Rightarrow$output samples. A$\lambda$goVista will then search its database looking for problems that map input to output. As a concrete example, consider the query in Figure 1(c). This query asks:

``Suppose that from the linked structure on the left of the $\Rightarrow$ I compute the list of nodes to the right. What function f am I then computing?''

A$\lambda$goVista might then respond with:

``This looks like a topological sort of a directed acyclic graph. You can read more about topological sorting at http://hissa.ncsl.nist.gov/~black/CRCDict/HTML/topologcsort.html. A Java implementation can be found at http://www.math.grin.edu/~rebelsky/Courses/152/97F/Outlines/outline.49.html''.

A$\lambda$goVista is also able to classify some simple combinatorial structures. Given the query in Figure 1(d), A$\lambda$goVista might respond with:

``This looks like a complete bipartite graph. You can read more about this structure at http://www.treasure-troves.com/math/CompleteBipartiteGraph.html.''