





'''simple docstring'''

# coding=utf-8
# Copyright 2023 The HuggingFace Inc. team.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
#     http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.

# this script dumps information about the environment

import os
import platform
import sys


__lowerCAmelCase							:     List[Any]		     ="3"

print("Python version:", sys.version)

print("OS platform:", platform.platform())
print("OS architecture:", platform.machine())

try:
  import torch

  print("Torch version:", torch.__version__)
  print("Cuda available:", torch.cuda.is_available())
  print("Cuda version:", torch.version.cuda)
  print("CuDNN version:", torch.backends.cudnn.version())
  print("Number of GPUs available:", torch.cuda.device_count())
except ImportError:
  print("Torch version:", None)

try:
  import transformers

  print("transformers version:", transformers.__version__)
except ImportError:
  print("transformers version:", None)










'''simple docstring'''

def 						UpperCamelCase    (							_lowerCamelCase : List[Any]						,	_lowerCamelCase : List[str]						,	_lowerCamelCase : List[str]						,	_lowerCamelCase : Tuple	):
    # Return True if there is node that has not iterated.
    A__    =      [False] * len(_lowerCamelCase	)
    A__    =      []
    queue.append(_lowerCamelCase	)
    A__    =      True

    while queue:
        A__    =      queue.pop(0	)
        for ind in range(len(graph[u]	)	):
            if visited[ind] is False and graph[u][ind] > 0:
                queue.append(_lowerCamelCase	)
                A__    =      True
                A__    =      u

    return visited[t]





def 						UpperCamelCase    (							_lowerCamelCase : Optional[Any]						,	_lowerCamelCase : Optional[Any]						,	_lowerCamelCase : Optional[int]	):
    # This array is filled by BFS and to store path
    A__    =      [-1] * (len(_lowerCamelCase	))
    A__    =      0
    while bfs(_lowerCamelCase						,	_lowerCamelCase						,	_lowerCamelCase						,	_lowerCamelCase	):
        A__    =      float("Inf"	)
        A__    =      sink

        while s != source:
            # Find the minimum value in select path
            A__    =      min(_lowerCamelCase						,	graph[parent[s]][s]	)
            A__    =      parent[s]

        max_flow += path_flow
        A__    =      sink

        while v != source:
            A__    =      parent[v]
            graph[u][v] -= path_flow
            graph[v][u] += path_flow
            A__    =      parent[v]
    return max_flow


__lowerCAmelCase							:     Any		     =[
    [0, 16, 13, 0, 0, 0],
    [0, 0, 10, 12, 0, 0],
    [0, 4, 0, 0, 14, 0],
    [0, 0, 9, 0, 0, 20],
    [0, 0, 0, 7, 0, 4],
    [0, 0, 0, 0, 0, 0],
]

__lowerCAmelCase     ,					__lowerCAmelCase							:     int		     =0, 5



print(ford_fulkerson(graph, source, sink))



