int silent_list_all_chains(Graph* graph) { int total = 0, i; Graph* copy = make_graph_copy(graph); for(i = 0; i < graph->verts; i++) total += silent_find_chains_from(copy, copy->vertex_list[i].id); free_graph(©); return total; }
void complete_graph_path(t_position *graph) { t_scope *d_buff; t_scope *d_buff_copy; while (graph != NULL) { d_buff = graph->graph; d_buff_copy = make_graph_copy(graph->graph); while (d_buff != NULL) { append_two_graph(d_buff->scope, d_buff_copy); d_buff = d_buff->next; } graph->graph = d_buff_copy; graph = graph->next; } }