CS 668 Graphs, Algorithms, and Applications
Concepts of graph theory. Algorithms for graph traversal, shortest paths, connectivity, spanning trees, and matchings. Applications of graphs to computer programming, software engineering, VLSI design, networks and flows, and parallel programming. Before enrolling, a student is expected to have taken CS 224 or the equivalent of two semesters of programming courses and an undergraduate algorithms course.