MGF 1107
Graph Theory In Class Review
Name___________________
This activity will be done in class.
Working in groups is encouraged, but each member of
the group will turn in a completed review.
Please read and follow the directions
carefully.
Full credit will not be given unless the directions have been followed
completely.
1. The graph to the right has either A) an Euler circuit
B) an Euler path but no Euler circuit or C) neither
an Euler circuit nor an Euler path.
Choose A, B or
C and then use Euler’s Theorem to
explain your
choice
.
If it has an Euler path or circuit
show
the
path or circuit by
numbering the edges in the
order traveled.
Choice_____
Reason:
2. Use the Nearest Neighbor algorithm starting at vertex D to find
a Hamiltonian circuit.
Shade the edges, list the vertices in the
order visited and give the total weight.
Vertices List:______________________
Total Weight:_________
3
10
12
4
13
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
3. Use the greedy algorithm starting at vertex D to find a
Hamiltonian circuit. Shade the edges chosen and show the list
of edges in the order considered.
This is the end of the preview.
Sign up
to
access the rest of the document.
 Fall '11
 JamesLang
 Graph Theory, Glossary of graph theory, Leonhard Euler, Graph theory objects, Eulerian path, Seven Bridges of Königsberg

Click to edit the document details