Exam--summer-2018 created: 24 jul 2018 [25-jul-18 draw graph models, stating the type of graph (from table 1) used, to represent airline routes where every day there are four flights from boston to newark, two flights from newark to boston, three flights from newark to miami, two flights from miami to newark, one flight from newark to detroit, two flights from detroit to newark, three flights from newark to washington, two flights from washington to newark, and one flight from washington to miami, with 1. an edge between vertices representing cities that have a flight between them (in either direction) 2. an edge between vertices representing cities for each flight that operates between them (in either direction). 3. an edge between vertices representing cities for each flight that operates between them (in either direction), plus a loop for a special sightseeing trip that takes off and lands in miami.