Greedy Alogritmhs - Visualize a network 2

# Visualization
def visualize(edges, colors):
    from pyvis.network import Network
    # Create a network
    net = Network()
    edges = [(edges[i][0], edges[i][1], edges[i][2], colors[i]) for i in range(len(edges))]

    for u, v, weight, color in edges:
        net.add_node(u)
        net.add_node(v)
        net.add_edge(u, v, label=str(weight), color=color)
        # print(u, v, weight)
    net.show('network.html')




# MAIN FUNCTION
edges = [('A', 'B', 1),
        ('B', 'C', 4),
        ('B', 'D', 2),
        ('C', 'D', 6),
        ('A', 'D', 3)]

colors = ['red', 'blue', 'blue', 'blue', 'blue']

visualize(edges, colors)