Assertion: function's graph | /r/MadeOf | all of the original vertices
Facets:
Source sentences:
text: A spanning tree is a subgraph of a graph which contains all of the original vertices and which contains enough edges to make this subgraph connected, but not so many edges that there is a cycle in the subgraph.