

'''simple docstring'''

def 					__UpperCamelCase				(						lowercase__    :	Any			):






     '''simple docstring'''





     return [
         {
             0: [1, 2],
             1: [0, 2],
             2: [0, 1, 3, 5],
             3: [2, 4],
             4: [3],
             5: [2, 6, 8],
             6: [5, 7],
             7: [6, 8],
             8: [5, 7],
         },
         {
             0: [6],
             1: [9],
             2: [4, 5],
             3: [4],
             4: [2, 3],
             5: [2],
             6: [0, 7],
             7: [6],
             8: [],
             9: [1],
         },
         {
             0: [4],
             1: [6],
             2: [],
             3: [5, 6, 7],
             4: [0, 6],
             5: [3, 8, 9],
             6: [1, 3, 4, 7],
             7: [3, 6, 8, 9],
             8: [5, 7],
             9: [5, 7],
         },
         {
             0: [1, 3],
             1: [0, 2, 4],
             2: [1, 3, 4],
             3: [0, 2, 4],
             4: [1, 2, 3],
         },
     ][index]

def 					__UpperCamelCase				(						lowercase__    :	dict[int, list[int]]			):






     '''simple docstring'''





     __lowercase      		=0
     __lowercase      		=len(lowercase__			)  # No of vertices in graph
     __lowercase      		=[0] * n
     __lowercase      		=[False] * n

     def dfs(lowercase__    :	int,       lowercase__    :	str,       lowercase__    :	Dict,       lowercase__    :	str			):
          __lowercase      		=True
          __lowercase      		=id_
          id_ += 1
          for to in graph[at]:
               if to == parent:
                    pass
               elif not visited[to]:
                    dfs(lowercase__,       lowercase__,       lowercase__,       id_			)
                    __lowercase      		=min(low[at],       low[to]			)
                    if id_ <= low[to]:
                         bridges.append((at, to) if at < to else (to, at)			)
               else:
                    # This edge is a back edge and cannot be a bridge
                    __lowercase      		=min(low[at],       low[to]			)

     __lowercase      		=[]
     for i in range(lowercase__			):
          if not visited[i]:
               dfs(lowercase__,       -1,       lowercase__,       id_			)
     return bridges


if __name__ == "__main__":
       import doctest

       doctest.testmod()





'''simple docstring'''

from dataclasses import dataclass, field
from typing import ClassVar, Dict

from ..features import Features, Value
from .base import TaskTemplate


@dataclass(frozen=A )
class 	lowerCAmelCase  (   A ):
       # `task` is not a ClassVar since we want it to be part of the `asdict` output for JSON serialization
       lowerCAmelCase_												=			field(default="summarization" ,      metadata={"include_in_asdict_even_if_is_default": True} )
       lowerCAmelCase_												=			Features({"text": Value("string" )} )
       lowerCAmelCase_												=			Features({"summary": Value("string" )} )
       lowerCAmelCase_												=			"text"
       lowerCAmelCase_												=			"summary"







       @property
       def       snake_case (				self      :			int   ):







            """simple docstring"""







            return {self.text_column: "text", self.summary_column: "summary"}


