Minimum Spanning Tree Problem
I am interested in developing a practical application with regard to finding minimum spanning tree. Say one has an un-directed graph that has weighted edges. The goal would be to find the minimum spanning tree that connects all points on the graph with the lowest weight. How would this problem be mapped to a D Wave computer?