Hackerrank: Set of Nodes

from math import log, floor

def solve(n, edges):
    networks = []
    for edge in edges:
        a, b = edge.split()
        for network in networks:
            if a in network:
                network.add(b)
                break
            elif b in network:
                network.add(a)
                break
        else:
            networks.append({a, b})
    return sum(floor(log(len(network))) for network in networks)