What is a spanning tree? a minimum spanning tree?

A spanning tree is a subgroup of Graph G, covering all vertices with a lowest number of possible edges

Explanation:

A spanning tree is a subgroup of Graph G, covering all vertices with a lowest number of possible edges. Therefore, a spanning tree has no patterns and can not be separated. we can concluded this also every graph G is more or less has one spanning tree.The spanning tree's cost is the total amount of all the edges in the tree's weights. There can be a numerous number of trees spanning. Minimum spanning tree is the type of spanning tree where the value of all spanning trees is minimal.

there is no universally accepted definition of art. although commonly used to describe something of beauty, or a skill which produces an aesthetic result, there is no clear line in principle between (say) a unique piece of handmade sculpture, and a mass-produced but visually attractive item. we might say that art requires thought - some kind of creative impulse - but this raises more questions: for example, how much thought is required? if someone flings paint at a canvas, hoping by this action to create a work of art, does the result automatically constitute art?