def check_binary_search(self, B, edges, level=2): t = binary_search_using_charikar( self.g1, R, B=B, level=3 ) assert_equal( sorted(edges), sorted(t.edges()) )
# nodes_to_remove.append(n) print(nodes_to_remove) for n in nodes_to_remove: g.remove_node(n) # pos = nx.graphviz_layout(g, prog='dot') # nx.draw(g, pos, # node_color=map(lambda n: 'black' if n == root else 'gray', # g.nodes_iter()) # ) # nx.draw_networkx_labels(g, # pos=pos, # labels={n: str(n) for n in g.nodes_iter()}, # font_color='red' # ) # plt.savefig( # '/cs/home/hxiao/public_html/figures/tree_inspection/{}.png'.format(root) # ) quota_based_method = lambda g, r, U: binary_search_using_charikar( g, r, U, level=2 ) quota_based_method(g, root, 1.0)
def check_binary_search(self, B, edges, level=2): t = binary_search_using_charikar(self.g1, R, B=B, level=3) assert_equal(sorted(edges), sorted(t.edges()))
# for n in g.nodes_iter(): # if g.in_degree(n) == 0 and n != root: # nodes_to_remove.append(n) print(nodes_to_remove) for n in nodes_to_remove: g.remove_node(n) # pos = nx.graphviz_layout(g, prog='dot') # nx.draw(g, pos, # node_color=map(lambda n: 'black' if n == root else 'gray', # g.nodes_iter()) # ) # nx.draw_networkx_labels(g, # pos=pos, # labels={n: str(n) for n in g.nodes_iter()}, # font_color='red' # ) # plt.savefig( # '/cs/home/hxiao/public_html/figures/tree_inspection/{}.png'.format(root) # ) quota_based_method = lambda g, r, U: binary_search_using_charikar( g, r, U, level=2) quota_based_method(g, root, 1.0)