I'm working on an exam question that asks me to run the Double-Tree Heuristic algorithm on the following graph:This algorithm starts by finding a minimum cost spanning tree. My solution: Minimum spanning tree contains edges ec, cb, dc, daDoubling these edges to find an Euler tour: a, d, c, b, c, e, c, d, aRemoving duplicate edges: a, d, c, b, e, aActual solution:Minimum spanning tree contains edges ed, ec, cb, daDoubling these edges to find the Euler tour: a d e c b c e d aRemoving duplicate edges: a d e c b a (cost: 51)I want to know if I have used the algorithm correctly. Can there be more than 1 specific solution to this problem?  
Running the Double Tree Heuristic in a given graph - some slight confusion
graphs