MSTA, illustrates three different algorithms for finding a minimal spanning tree between nodes on a Cartesian plane. By comparing these algorithms in a graphical manner this animation allows the viewer to observe the different strategies each algorithm employs. Specific details of the algorithms such as their ability to be run in parallel or to find minimal sub-spanning trees become apparent when represented visually.