


'''simple docstring'''




import random


def    UpperCAmelCase_  (       A		,	A		,	A = False      ):
   '''simple docstring'''





   _a					:  dict						=  {i: [] for i in range(A      )}

   # if probability is greater or equal than 1, then generate a complete graph
   if probability >= 1:
      return complete_graph(A      )
   # 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(A      ):
      for j in range(i + 1		,	A      ):
         if random.random() < probability:
            graph[i].append(A      )
            if not directed:
               # if the graph is undirected, add an edge in from j to i, either
               graph[j].append(A      )
   return graph


def    UpperCAmelCase_  (       A      ):
   '''simple docstring'''





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


if __name__ == "__main__":
 import doctest

 doctest.testmod()






'''simple docstring'''




def    UpperCAmelCase_  (       A		,	A      ):
   '''simple docstring'''





   return "\n".join(
       f'''{number} * {i} = {number * i}''' for i in range(1		,	number_of_terms + 1      )      )


if __name__ == "__main__":
 print(multiplication_table(number=5, number_of_terms=10))


