Consider the following graph, which has an Eulerian Path, but not an Eulerian circuit.
A
C
E
D
Give the Eulerian path following the convention that you should start at the alphabetically earliest allowed vertex and that whenever there is a choice in the algorithm, make the earliest alphabetically available choice.
The first vertex in the path will be
and the last vertex will be
The full Eulerian path is
Consider the following weighted graph.
3
5
1
2
6
(Enter your answer as a string of letters in either upper or lower case, with no spaces.)
The weight of the minimal weight spanning tree is
(You could use either Kruskal's algorithm, or by simple inspection. Give your answer as a number, not a word, as in "3", not "three".)
