A strong law of large numbers for random biased connected graphs

We consider a class of random connected graphs with random vertices and random edges in which the randomness of the vertices is determined by a continuous probability distribution and the randomness of the edges is determined by a connection function. We derive a strong law of large numbers on the total lengths of all random edges for a random biased connected graph that is a generalization of a directed $k$-nearest-neighbor graph.