code: def add_reverse_arcs(graph, capac=None):
      
      for u in range(len(graph)):
          for v in graph[u]:
              if u not in graph[v]:
                  if type(graph[v]) is list:
                      graph[v].append(u)
                      if capac:
                          capac[v][u] = 0
                  else:
                      assert type(graph[v]) is dict
                      graph[v][u] = 0
docs: Utility function for flow algorithms that need for every arc (u,v),
      the existence of an (v,u) arc, by default with zero capacity.
      graph can be in adjacency list, possibly with capacity matrix capac.
      or graph can be in adjacency dictionary, then capac parameter is ignored.
  
      :param capac: arc capacity matrix
      :param graph: in listlist representation, or in listdict representation, in this case capac is ignored
      :complexity: linear
      :returns: nothing, but graph is modified