コード例 #1
0
def is_isomorphism(g, D=[], I=[], iso_found=False):
    coloring = alpha_coloring(g, D, I)
    highest_degree = -1
    for key in coloring.keys():
        if key > highest_degree:
            highest_degree = key
    coloring = minimization_partitioning(coloring, highest_degree)

    for key in coloring.keys():
        color_class = coloring[key]
        for vertex in color_class:
            vertex.setColornum(key)

    if not is_balanced(coloring, len(g.V())):
        return False
    if defines_bijection(coloring):
        return True
    if iso_found:
        return True
    color_class = None
    for key in coloring.keys():
        if len(coloring.get(key)) >= 4:
            color_class = coloring.get(key)
            break
    x = None
    for node in color_class:
        if node.getLabel() < len(g.V()) // 2:
            x = node
    iso_found = False
    C_intersect_H = []
    for v in color_class:
        if v.getLabel() >= len(g.V()) // 2:
            C_intersect_H.append(v)
    D_x = []
    D_x.extend(D)
    D_x.append(x)
    for y in C_intersect_H:
        I_y = []
        I_y.extend(I)
        I_y.append(y)
        iso_found = is_isomorphism(g, D_x, I_y, iso_found) > 0
        if iso_found:
            return True
    return iso_found
コード例 #2
0
def count_isomorphism(g, d=[], i=[]):
    coloring = alpha_coloring(g, d, i)
    highest_degree = -1
    for key in coloring.keys():
        if key > highest_degree:
            highest_degree = key
    coloring = minimization_partitioning(coloring, highest_degree)
    for key in coloring.keys():
        color_class = coloring[key]
        for vertex in color_class:
            vertex.setColornum(key)
    if not is_balanced(coloring, len(g.V())):
        return 0
    if defines_bijection(coloring):
        return 1
    color_class = None
    for key in coloring.keys():
        if len(coloring.get(key)) >= 4:
            color_class = coloring.get(key)
            break
    x = None
    for node in color_class:
        if node.getLabel() < len(g.V()) // 2:
            x = node
    num = 0
    c_intersect_h = []
    for v in color_class:
        if v.getLabel() >= len(g.V()) // 2:
            c_intersect_h.append(v)
    d_x = []
    d_x.extend(d)
    d_x.append(x)
    for y in c_intersect_h:
        i_y = []
        i_y.extend(i)
        i_y.append(y)
        for key in coloring.keys():
            color_class = coloring[key]
            for vertex in color_class:
                vertex.setColornum(key)
        num += count_isomorphism(g, d_x, i_y)
    return num