Sit Quietly and Program: Graph Search Algorithms*
I'll play remixes of John Cage's 4'33 for the rest of the session.
Graph-Search algorithms – which is to say, code to find the shortest path to a particular destination through a connected graph – have many applications. The obvious use-case is trip planning, but many other problems can be decomposed into graph traversals.
I’ll give a brief introduction to classic graph-search algorithms (Dijkstra’s Algorithm and A-Star), and a handout describing them in pseudocode.
A web service will be available to provide randomly generated graphs to test code against. Participants may implement the given algorithms, or variations on that idea, to solve the problem of navigating the graphs efficiently.
None. Fortunately, I don't plan to say much.