Functions to generate random weighted trees and complete graphs

random_graphs.py

def random_tree(V):
    heads = [i for i in range(V-1)]
    tails = [i+1 for i in range(V-1)]
    weights = list(np.random.rand(V-1))
    G = [[heads[i],tails[i],weights[i]] for i in range(len(heads))]
    return V, G


def random_complete_graph(V):
    heads, tails, weights = [], [], []
    for i in range(V-1):
        for j in range(i+1, V):
            heads.append(i)
            tails.append(j)
    weights = list(np.random.rand(len(heads)))
    G = [[heads[i],tails[i],weights[i]] for i in range(len(heads))]
    return V, G