APRONYM
purity
87% SPANNING TREESSilly! Prim's Algorithm's Not Necessarily Iterated (so) Numbingly Gradually. This is Really Easy, Elementary Stuff! Angela Brett, when a tutor was spending an hour finding the minimum cost spanning tree for a graph using Prim's algorithm, writing every single step on the board. It could have all been done in about 45 seconds - basically a game of join the dots where instead of finding the next number to decide which dot to go to next, we have to work out the minimum of a few numbers.
Science:Mathematics
Education:Slow Teaching
Tweet