Assertion: graph's edge | /r/HasProperty | 64 65 66 struct queue
Facets:
Source sentences:
text: 37 38 n = graph_vertex_count ( g ); ); 39 40 s -> preorder = create_empty_array ( n ); ->); 41 s -> time = create_empty_array ( n ); ->); 42 s -> parent = create_empty_array ( n ); ->); 43 s -> depth = create_empty_array ( n ); ->); 44 45 return s ; 46 } 47 48 49 void 50 search_info_destroy ( struct search_info * s ) 51 { 52 free ( s -> depth ); ->); 53 free ( s -> parent ); ->); 54 free ( s -> time ); ->); 55 free ( s -> preorder ); ->); 56 free ( s ); ); 57 } 58 59 60 struct edge { 61 int u ; 62 int v ; 63 }; }; 64 65 66 struct queue { 67 struct edge