CS 428 - Introduction to Graph Algorithms

Description:
This course gives a wide introduction to the field of graph algorithms. Students will learn how to recognize and analyze algorithmic graph problems, as well as how to develop practical approaches for solving them. Course will not have an established scheduling pattern (Spring).

Prerequisites:
Prerequisite: CS 302 and MATH 330.

Credits: (4)

Learner Outcomes:
Upon successful completion of this course, the student will be able to:

Demonstrate knowledge of algorithmic ideas and principles discussed in class.
Distinguish between different types of graph problems and choose algorithms which solve them.
Analyze an optimization problem, transform it into a graph problem, and implement a program solving it.
Propose an algorithmic approach to solve the graph problem of term project.
Justify chosen algorithms, data structures, and other design decisions in submitted implementation.

Learner Outcomes Approval Date:
1/4/18