generate_WS.py [16:55]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    neighbor = len(G[i])
    bb_1 = np.sum([assignments[j] for j in G[i]])
    bb_0 = neighbor - bb_1
    bbb_0 = 0
    bbb_1 = 0
    bbb_2 = 0
    bbn_0 = 0
    bbn_1 = 0
    bbn_2 = 0
    open_square_0 = 0
    open_square_1 = 0
    open_square_2 = 0
    open_square_3 = 0
    for j in G[i]:
        for k in G[i]:
            if k > j:
                if np.abs(j-k) <= 5: # this is a simplistic weight to judge if connected (to speed up )
                    if assignments[j] + assignments[k] == 0:
                        bbb_0 += 1
                    elif assignments[j] + assignments[k] == 1:
                        bbb_1 += 1
                    else:
                        bbb_2 += 1
                else:
                    if assignments[j] + assignments[k] == 0:
                        bbn_0 += 1
                    elif assignments[j] + assignments[k] == 1:
                        bbn_1 += 1
                    else:
                        bbn_2 += 1
                    for l in G[i]:
                        if l > k and np.abs(l-k) > 5 and np.abs(l-j) > 5:
                            if assignments[j] + assignments[k] + assignments[l] == 0:
                                open_square_0 += 1
                            elif assignments[j] + assignments[k] + assignments[l]== 1:
                                open_square_1 += 1
                            elif assignments[j] + assignments[k] + assignments[l]== 2:
                                open_square_2 += 1
                            else:
                                open_square_3 += 1
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -



generate_WS.py [146:186]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
        neighbor = len(G[i])
        bb_1 = np.sum([assignments[j] for j in G[i]])
        bb_0 = neighbor - bb_1
        bbb_0 = 0
        bbb_1 = 0
        bbb_2 = 0
        bbn_0 = 0
        bbn_1 = 0
        bbn_2 = 0
        open_square_0 = 0
        open_square_1 = 0
        open_square_2 = 0
        open_square_3 = 0

        for j in G[i]:
            for k in G[i]:
                if k > j:
                    if np.abs(j-k) <= 5:
                        if assignments[j] + assignments[k] == 0:
                            bbb_0 += 1
                        elif assignments[j] + assignments[k] == 1:
                            bbb_1 += 1
                        else:
                            bbb_2 += 1
                    else:
                        if assignments[j] + assignments[k] == 0:
                            bbn_0 += 1
                        elif assignments[j] + assignments[k] == 1:
                            bbn_1 += 1
                        else:
                            bbn_2 += 1
                        for l in G[i]:
                            if l > k and np.abs(l-k) > 5 and np.abs(l-j) > 5:
                                if assignments[j] + assignments[k] + assignments[l] == 0:
                                    open_square_0 += 1
                                elif assignments[j] + assignments[k] + assignments[l]== 1:
                                    open_square_1 += 1
                                elif assignments[j] + assignments[k] + assignments[l]== 2:
                                    open_square_2 += 1
                                else:
                                    open_square_3 += 1
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -