





'''simple docstring'''

import argparse

import torch

from transformers import FunnelBaseModel, FunnelConfig, FunnelModel, load_tf_weights_in_funnel
from transformers.utils import logging


logging.set_verbosity_info()





def 						UpperCamelCase    (							_lowerCamelCase : str						,	_lowerCamelCase : Any						,	_lowerCamelCase : Optional[int]						,	_lowerCamelCase : List[Any]	):
    # Initialise PyTorch model
    A__    =      FunnelConfig.from_json_file(_lowerCamelCase	)
    print(F"Building PyTorch model from configuration: {config}"	)
    A__    =      FunnelBaseModel(_lowerCamelCase	) if base_model else FunnelModel(_lowerCamelCase	)

    # Load weights from tf checkpoint
    load_tf_weights_in_funnel(_lowerCamelCase						,	_lowerCamelCase						,	_lowerCamelCase	)

    # Save pytorch-model
    print(F"Save PyTorch model to {pytorch_dump_path}"	)
    torch.save(model.state_dict()						,	_lowerCamelCase	)


if __name__ == "__main__":
  __lowerCAmelCase							:     int		     =argparse.ArgumentParser()
  # Required parameters
  parser.add_argument(
      "--tf_checkpoint_path", default=None, type=str, required=True, help="Path to the TensorFlow checkpoint path."
  )
  parser.add_argument(
      "--config_file",
      default=None,
      type=str,
      required=True,
      help="The config json file corresponding to the pre-trained model. \nThis specifies the model architecture.",
  )
  parser.add_argument(
      "--pytorch_dump_path", default=None, type=str, required=True, help="Path to the output PyTorch model."
  )
  parser.add_argument(
      "--base_model", action="store_true", help="Whether you want just the base model (no decoder) or not."
  )
  __lowerCAmelCase							:     int		     =parser.parse_args()
  convert_tf_checkpoint_to_pytorch(
      args.tf_checkpoint_path, args.config_file, args.pytorch_dump_path, args.base_model
  )










'''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))



