code: def is_clockwise(vertices):
      
      it = iterator.consecutive(cycle(vertices), 3)
      clockwise = 0
      counter = 0
      for _ in range(len(vertices)):
          p0, p1, p2 = next(it)
          cross = cross_product(p1, p2, p0)
          int_angle = interior_angle(p0, p2, p1)  # raises ValueError
          if cross < 0:
              clockwise += int_angle
              counter += 2 * pi - int_angle
          else:
              clockwise += 2 * pi - int_angle
              counter += int_angle
      if round(clockwise / pi) == len(vertices) - 2:
          return True
      elif round(counter / pi) == len(vertices) - 2:
          return False
      else:
          raise ValueError("the polygon is complex or overlapped")
docs: Evaluate whether vertices are in clockwise order.
      Args:
        vertices: list of vertices (x, y) in polygon.
      Returns:
        True: clockwise, False: counter-clockwise
      Raises:
        ValueError: the polygon is complex or overlapped.