






import random



def       _SCREAMING_SNAKE_CASE    (			__lowercase :      int      ,					__lowercase :      float      ,					__lowercase :      bool = False     )    ->   dict:





    """simple docstring"""

    __A       =						{i: [] for i in range(__lowercase     )}

    # if probability is greater or equal than 1, then generate a complete graph
    if probability >= 1:
        return complete_graph(__lowercase     )
    # if probability is lower or equal than 0, then return a graph without edges
    if probability <= 0:
        return graph

    # for each couple of nodes, add an edge from u to v
    # if the number randomly generated is greater than probability probability
    for i in range(__lowercase     ):
        for j in range(i + 1      ,					__lowercase     ):
            if random.random() < probability:
                graph[i].append(__lowercase     )
                if not directed:
                    # if the graph is undirected, add an edge in from j to i, either
                    graph[j].append(__lowercase     )
    return graph



def       _SCREAMING_SNAKE_CASE    (			__lowercase :      int     )    ->   dict:





    """simple docstring"""

    return {
        i: [j for j in range(__lowercase     ) if i != j] for i in range(__lowercase     )
    }


if __name__ == "__main__":
  import doctest

  doctest.testmod()












def       _SCREAMING_SNAKE_CASE    (			__lowercase :      str     )    ->   str:





    """simple docstring"""

    __A       =						""""""
    for ch in key:
        if ch == " " or ch not in key_no_dups and ch.isalpha():
            key_no_dups += ch
    return key_no_dups



def       _SCREAMING_SNAKE_CASE    (			__lowercase :      str     )    ->   dict[str, str]:





    """simple docstring"""

    __A       =						[chr(i + 6_5     ) for i in range(2_6     )]
    # Remove duplicate characters from key
    __A       =						remove_duplicates(key.upper()     )
    __A       =						len(__lowercase     )
    # First fill cipher with key characters
    __A       =						{alphabet[i]: char for i, char in enumerate(__lowercase     )}
    # Then map remaining characters in alphabet to
    # the alphabet from the beginning
    for i in range(len(__lowercase     )      ,					2_6     ):
        __A       =						alphabet[i - offset]
        # Ensure we are not mapping letters to letters previously mapped
        while char in key:
            offset -= 1
            __A       =						alphabet[i - offset]
        __A       =						char
    return cipher_alphabet



def       _SCREAMING_SNAKE_CASE    (			__lowercase :      str      ,					__lowercase :      dict[str, str]     )    ->   str:





    """simple docstring"""

    return "".join(cipher_map.get(__lowercase      ,					__lowercase     ) for ch in message.upper()     )



def       _SCREAMING_SNAKE_CASE    (			__lowercase :      str      ,					__lowercase :      dict[str, str]     )    ->   str:





    """simple docstring"""

    __A       =						{v: k for k, v in cipher_map.items()}
    return "".join(rev_cipher_map.get(__lowercase      ,					__lowercase     ) for ch in message.upper()     )



def       _SCREAMING_SNAKE_CASE    (			)    ->   None:





    """simple docstring"""

    __A       =						input("""Enter message to encode or decode: """     ).strip()
    __A       =						input("""Enter keyword: """     ).strip()
    __A       =						input("""Encipher or decipher? E/D:"""     ).strip()[0].lower()
    try:
        __A       =						{"""e""": encipher, """d""": decipher}[option]
    except KeyError:
        raise KeyError("""invalid input option"""     )
    __A       =						create_cipher_map(__lowercase     )
    print(func(__lowercase      ,					__lowercase     )     )


if __name__ == "__main__":
  import doctest

  doctest.testmod()
  main()




