Wolfram Function Repository (Under Development)
Instantuse addon functions for the Wolfram Language
Given vertices, return a complete graph with edge weights equal to edge lengths
ResourceFunction["WeightedDistanceGraph"][vert] Given the list of vertices vert, return a graph where edges are vertex pairs weighted by their Euclidean distance. 
The output based on the KreiselKurz integral heptagon looks like a random complete graph:
In[1]:= 

Out[2]= 

The graph has edgeweights:
In[3]:= 

Out[3]= 

The Wolfram Language has several graph functions which work on point sets which do not return weighted graphs. Operations on graphs without proper weighting can return unexpected results:
In[4]:= 

Out[5]= 

With weights given to edges, a method like Kruskal’s algorithm can work as expected:
In[6]:= 

Out[7]= 

With weights given to edges, a method like Prim’s algorithm can work as expected:
In[8]:= 

Out[8]= 

Using weighted graphs for finding a minimal spanning tree doesn’t scale up well for larger graphs:
In[9]:= 

Out[9]= 

In these cases it’s better to go right to the algorithm, which is several thousand times faster:
In[10]:= 

In[11]:= 

Out[11]= 
