|
AQR Networks & Graphs QUIZ #1 Make sure when entering words as answers, you spell the words correctly!! A circuit is defined to be a path through a graph that begins and ends at the same ___________________. ____________, and an Euler Circuit uses each _____________ exactly _____________. A path and a circuit both begin and end at the same vertex. True False A graph is an Euler Circuit if all of the ______________ have an ______________ ________________. True False The given graph is a Hamiltonian Circuit. False True The given graph is an Euler Circuit. Solve this Weighted Graph. Solve this Weighted Graph What is step number 3 of solving weighted graphs? Add the backtracked time to the total weights Add the total of the weights Identify all odd degree vertices Find the shortest path for backtracking Conjectures exist that allow you to easily identify whether or not a graph is an Euler Circuit or a Hamiltonian Circuit. True False |