134   queue_type queue_list;  member
713   augmenting_path->queue_list.queue = (int *)  in init_augmenting_path()
715   augmenting_path->queue_list.size = graph_size + 2;  in init_augmenting_path()
724   free (augmenting_path->queue_list.queue);  in free_augmenting_path()
733 init_queue (queue_type *queue_list)  in init_queue()  argument
735   gcc_assert (queue_list);  in init_queue()
736   queue_list->head = 0;  in init_queue()
737   queue_list->tail = 0;  in init_queue()
742 is_empty (queue_type *queue_list)  in is_empty()  argument
744   return (queue_list->head == queue_list->tail);  in is_empty()
749 enqueue (queue_type *queue_list, int x)  in enqueue()  argument
751   gcc_assert (queue_list->tail < queue_list->size);  in enqueue()
752   queue_list->queue[queue_list->tail] = x;  in enqueue()
753   (queue_list->tail)++;  in enqueue()
758 dequeue (queue_type *queue_list)  in dequeue()  argument
761   gcc_assert (queue_list->head >= 0);  in dequeue()
762   x = queue_list->queue[queue_list->head];  in dequeue()
763   (queue_list->head)++;  in dequeue()
968   queue_type *queue_list;  in find_augmenting_path()  local
975   queue_list = &(augmenting_path->queue_list);  in find_augmenting_path()
984   init_queue (queue_list);  in find_augmenting_path()
985   enqueue (queue_list, source);  in find_augmenting_path()
988   while (!is_empty (queue_list))  in find_augmenting_path()
990       u = dequeue (queue_list);  in find_augmenting_path()
999 	      enqueue (queue_list, dest);  in find_augmenting_path()