deletions | additions       diff --git a/Notice_that_when_looking_at__.tex b/Notice_that_when_looking_at__.tex  index d6af92b..6f889dc 100644  --- a/Notice_that_when_looking_at__.tex  +++ b/Notice_that_when_looking_at__.tex 
...
Notice that when looking at the figure to the right, all the vertices of the original graph are included but no cycle can be drawn.  From this, given that weights are assigned to each of the edges, one could find what we call the minimum spanning tree. This provides a tree which has the least weight of all the possible trees that could be formed from the original graph. Minimum spanning trees are used, for example, to minimize the cost of power networks, wiring connections, piping, et. etc.  Referring back to our graph above, we see that this example is also a minimum spanning tree since it consists of all the lowest weighted edges.