711 init_augmenting_path (augmenting_path_type *augmenting_path, int graph_size)  in init_augmenting_path()  argument
713   augmenting_path->queue_list.queue = (int *)  in init_augmenting_path()
715   augmenting_path->queue_list.size = graph_size + 2;  in init_augmenting_path()
716   augmenting_path->bb_pred = (int *) xcalloc (graph_size, sizeof (int));  in init_augmenting_path()
717   augmenting_path->is_visited = (int *) xcalloc (graph_size, sizeof (int));  in init_augmenting_path()
722 free_augmenting_path (augmenting_path_type *augmenting_path)  in free_augmenting_path()  argument
724   free (augmenting_path->queue_list.queue);  in free_augmenting_path()
725   free (augmenting_path->bb_pred);  in free_augmenting_path()
726   free (augmenting_path->is_visited);  in free_augmenting_path()
960 		      augmenting_path_type *augmenting_path, int source,  in find_augmenting_path()  argument
970   gcc_assert (augmenting_path);  in find_augmenting_path()
971   bb_pred = augmenting_path->bb_pred;  in find_augmenting_path()
973   is_visited = augmenting_path->is_visited;  in find_augmenting_path()
975   queue_list = &(augmenting_path->queue_list);  in find_augmenting_path()
1030   augmenting_path_type augmenting_path;  in find_max_flow()  local
1050   init_augmenting_path (&augmenting_path, fixup_graph->num_vertices);  in find_max_flow()
1052   bb_pred = augmenting_path.bb_pred;  in find_max_flow()
1053   while (find_augmenting_path (fixup_graph, &augmenting_path, source, sink))  in find_max_flow()
1103   free_augmenting_path (&augmenting_path);  in find_max_flow()