1. Warm Up – 3/14 - Friday 100 seats are to be apportioned.
Find the apportionment using
the Huntington-Hill method.
B)State any possible violations that
have occurred.

2. Crossing the Bridges Is it possible to cross all seven bridges without
re-crossing a bridge? Why or why not?

3. Graph Intro A graph is a set of vertices and
edges that connect those vertices.
Vertices, V = {A, B, C, D}
Edges, E = {AB, AB, AD, AC, AC, CD, BD}

4. Definitions
A path is a sequence of edges we travel to get from one vertice to another.
A Eulerian path is a path that uses every edge exactly once.
A Eulerian circuit is a Eulerian path that starts and ends on the same vertex.