What is a Minimum-Cost Spanning tree · Example he grap. A Has 16 spanning trees. some are D 4 The graph has two minimum-cost spanning trees, each with a BWhat is a Minimum-Cost Spanning Tree • Example: The graph Has 16 spanning trees. Some are: The graph has two minimum-cost spanning trees, each with a cost of 6: