Question

A B C D E F -- 28 ол -- A B с D E 20 53 2757 34 51 46 49 38 44 39 28 20 53 51 27 57 34 -- 3 49 38 41 46 44 F 5 39 3 41 The weights of edges in a graph are shown in the table above. Apply the sorted edges algorithm to the graph. Give your answer as a list of vertices, starting and ending at vertex A. Example: ABCDEFA

Answer 1

Here the smallest weight is 3 and that is from D to F so we are going to take that first. Next smallest is s and that is from А to F. Next smallest is ao and that is from А to c. Next smallest is 21 and that is from B toc. Next smallest is a8 and that is from I to B which is omitted because this results in a circuit. Next smallest is 34 and that is from C to D. which is also omitted because this results in three edges on c. Next smallest is 38 and that is from D to E

Next smallest is 39 that is from c to f which is omitted because this results in three edges on F. Next smallest is 41 that is from E tof which is omitted because this results in a circuit Next smallest is 44 that is from B tof which is omitted because this results in three edges on F. Next smallest is 46 that is from B to E. Finally our graph is over. our graph is C A 7) E Auswer is ACBEDFA