Apply iterative prunings to a graph until no more vertice of degree 1 remains.

response_to_pruning.py

def total_length_graph(graph):
    v_ew, _ =vertex_degree1_edge_weight(T)
    return np.sum(v_ew.values())    
    
def response_to_iterative_pruning(graph):
    '''return the number of vertices of degree 1 as a function of the number of pruning
    '''
    response = []
    response.append((0,number_of_degree1_vertices(graph)))
    #print number_of_degree1_vertices(graph)
    while number_of_degree1_vertices(graph)>0:
        #response.append(prune_graph_once(graph))
        response.append(prune_once_faster(graph))
        #print number_of_degree1_vertices(graph)
    data = np.array(response)
    #print data
    x = np.cumsum(data[:,0])
    y = data[:,1]
    return x, y