Thesis » QuynhNguyen-MS

        self.cutpoints = cutpoints

        self.Dv_B = [dict() for i in range(self.num_components)] # link weight

        self.reverse_Dv_B = [dict() for i in range(self.num_components)] # reverse link weight

        self.generate_reverse_link_weight()

        Q = self._inititalize_component_tree_weight()

        while Q:

            pair = Q.pop(0)

            if pair['type'] == 'component_vertex_pair':

                B_index = pair['value'][0]

                for cp in all_cutpoints:

                    if self.get_link_weight(B_index, cp) != -1:

                self.set_link_weight(B_index, v, size)

                Q = self._find_unknown_weight_wrt_cutpoint(v, Q)

            if pair['type'] == 'vertex_component_pair':

                B_index = pair['value'][0]

                v = pair['value'][1]

                print'  vc: %s %s' % (B_index, v)

                # update Q

                Q = self._find_unknown_weight_wrt_component(B_index, Q)

    def _inititalize_component_tree_weight(self):

        Q = []

        for i, comp in enumerate(self.bicomponents):

        return Q

    def _find_unknown_weight_wrt_cutpoint(self, cutpoint, Q):

        for i, Dv_B_comp in enumerate(self.Dv_B):

            for cp, value in Dv_B_comp.iteritems():

                if value == -1:

                    pair = {

                    }

                    Q.append(pair)

        return Q

    def __str__(self):

        return str(self.Dv_B)

    print 'link weight: '

    print(lw)

if __name__ == '__main__':

    # filepath = MAIN_CODE_DIR + '/input/simple_house.edges'

    # filepath = MAIN_CODE_DIR + '/input/simple2.edges'

    # filepath = MAIN_CODE_DIR + '/input/simple.edges'

    # filepath = MAIN_CODE_DIR + '/input/simple3.edges'

    file_suffix = 'edge_list'

    # Weight betweenness centrality