Generate a python program that has the following intention:

The intention of the program is to find the minimum spanning tree (MST) of a weighted undirected graph. A minimum spanning tree is a subgraph of a given graph that connects all the vertices together, with the minimum total weight of the edges.

The function minimum_spanning_tree takes a dictionary of edge weights as an input and returns a set of edges that form the MST. The function first sorts the edge weights in ascending order using the sorted function. It then iterates through the sorted edge weights and adds the current edge to the MST if it divides the graph into two components. The divide_by_point dictionary is used to NAME_1 track of which vertices are already part of the MST.

The program is a implementation of the Kruskal's algorithm for finding the MST.