




"""simple docstring"""







def      __snake_case (				_lowercase    ):


    """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      __snake_case (				_lowercase    ):


    """simple docstring"""







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

    def dfs(_lowercase			,_lowercase			,_lowercase			,_lowercase    ):
        UpperCamelCase              =	True
        UpperCamelCase              =	id_
        id_ += 1
        for to in graph[at]:
            if to == parent:
                pass
            elif not visited[to]:
                dfs(UpperCamelCase__			,UpperCamelCase__			,UpperCamelCase__			,id_    )
                UpperCamelCase              =	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
                UpperCamelCase              =	min(low[at]			,low[to]    )

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


if __name__ == "__main__":
  import doctest

  doctest.testmod()





'''simple docstring'''


from __future__ import annotations



def  _SCREAMING_SNAKE_CASE     (      UpperCamelCase__    :					list[float]				):




     """simple docstring"""


     if len(UpperCamelCase__				) < 2:
          raise ValueError("""Monogons and Digons are not polygons in the Euclidean space"""				)
     if any(i <= 0 for i in nums				):
          raise ValueError("""All values must be greater than 0"""				)
     a_     :							int     						=  nums.copy()
     copy_nums.sort()
     return copy_nums[-1] < sum(copy_nums[:-1]				)


if __name__ == "__main__":
 import doctest

 doctest.testmod()
