Study your flashcards anywhere!
Download the official Cram app for free >
 Shuffle
Toggle OnToggle Off
 Alphabetize
Toggle OnToggle Off
 Front First
Toggle OnToggle Off
 Both Sides
Toggle OnToggle Off
 Read
Toggle OnToggle Off
How to study your flashcards.
Right/Left arrow keys: Navigate between flashcards.right arrow keyleft arrow key
Up/Down arrow keys: Flip the card between the front and back.down keyup key
H key: Show hint (3rd side).h key
A key: Read text to speech.a key
24 Cards in this Set
 Front
 Back
Alabama Paradox

when you increase H.S., but a delegation gets smaller


House Size Criterion

an Increase in H.S. should Never, decrease a delegation


Population Criterion

no state whose population increases should lose a seat to a state whose population decreases


Graph

Dots (vertices; Vertex) Connected by lines (edges)


Path

is a series of edges that connect two vertices


Two Vertices are Connected if...

there is a path between them


Unicursal tracing

meaning one drawing. without having to lift up your hand


Degree

# of edges that meet


Euler's Theorem

A connected graph with all vertices of even degree has a Unicursal Tracing/Eurler Paths.


circuit

a path that starts and ends at the same vertex


Eulerize

add edges (doubling those that already exist to make even degree methods


Optimal

Best Possible


Cheapest Link Algorithim

1. Color the shortest edge
2. continue to color the next shortest edge but not if 3 edges meet. 3. Connect ends to make a circuit 

Algorithim

step by step


Tree

Graph with no edges


Digraph

graph whos edges are arrows


Hamilton Circuit

circuit that goes through every vertex


Eulerize

add edges (doubling those that already exist to make even degree methods


Optimal

Best Possible


Cheapest Link Algorithim

1. Color the shortest edge
2. continue to color the next shortest edge but not if 3 edges meet. 3. Connect ends to make a circuit 

Algorithim

step by step


Tree

Graph with no edges


Digraph

graph whos edges are arrows


Hamilton Circuit

circuit that goes through every vertex
