InclassreviewCh6

InclassreviewCh6 - MGF 1107 Graph Theory In Class Review...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
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 13
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
3. Use the greedy algorithm starting at vertex D to find a Hamiltonian circuit. Shade the edges chosen and show the list
Background image of page 2
Background image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/18/2011 for the course MGF 1107 taught by Professor Jameslang during the Fall '11 term at Valencia.

Page1 / 3

InclassreviewCh6 - MGF 1107 Graph Theory In Class Review...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online