Angel Garcia

3 Responses to Angel Garcia

1. Kate Poirier says:

   April 3, 2016 at 2:51 pm

   Looks good Angel! Since Kruskal’s algorithm (as well as Prim’s) is defined by adding edges to your minimal spanning tree in a particular order, please indicate this order in your answer. (That is, your answer isn’t *just* the minimal spanning tree, but also an ordering of its edges.)

   Reply
2. Angel Garcia says:

   April 3, 2016 at 11:52 pm

   As an example I would put {EF, AD, HI, FC, EH, BC, GH} Correct?

   Reply
3. Angel Garcia says:

   April 3, 2016 at 11:52 pm

   As an example I would put {EF, AD, HI, FC, EH, BC, GH} Correct?

   Reply