#$2$ Visit every vertex in a path. Do not return to the school where you started.

A local business has several deliveries to some of the elementary schools in Holyoke. Find the best delivery route for the driver to take.

Sullivan

Times between schools in minutes $($the picture got too busy$)$

$\backslash$table$[[,$Sullivan,EN White,Lawrence,Kelly,Morgan,Mc Mahon$],[$Sullivan$,--,6\mathrm{.}5,7,11,9\mathrm{.}2,6],[$EN White,$6\mathrm{.}5,--,8,10\mathrm{.}5,10,9\mathrm{.}5],[$Lawrence$,7,8,--,4\mathrm{.}5,3,9],[$Kelly$,11,10\mathrm{.}5,4\mathrm{.}5,--,4,12],[$Morgan$,9\mathrm{.}2,10,3,4,--,8\mathrm{.}5],[$Mc Mahon,$6,9\mathrm{.}5,9,12,8\mathrm{.}5,--]]$

There are graphs with only vertices on the next two pages to help you fill in the edges for each nearest neighbor attempt and sorted edges.

Use the worksheets on the next two pages for this problem.

Worksheet pages for #$2$: make a single path that visits each school only once.

$27$