docs: def place(vertices_resources, nets, machine, constraints):
      """Assigns vertices to chips in Reverse-Cuthill-McKee (RCM) order.
  
      The `RCM <https://en.wikipedia.org/wiki/Cuthill%E2%80%93McKee_algorithm>`_
      algorithm (in graph-centric terms) is a simple breadth-first-search-like
      heuristic which attempts to yield an ordering of vertices which would yield
      a 1D placement with low network congestion.  Placement is performed by
      sequentially assigning vertices in RCM order to chips, also iterated over
      in RCM order.
  
      This simple placement scheme is described by Torsten Hoefler and Marc Snir
      in their paper entitled 'Generic topology mapping strategies for
      large-scale parallel architectures' published in the Proceedings of the
      international conference on Supercomputing, 2011.
  
      This is a thin wrapper around the :py:func:`sequential
      <rig.place_and_route.place.sequential.place>` placement algorithm which
      uses an RCM ordering for iterating over chips and vertices.
  
      Parameters
      ----------
      breadth_first : bool
          Should vertices be placed in breadth first order rather than the
          iteration order of vertices_resources. True by default.
      """
      return sequential_place(vertices_resources, nets,
                              machine, constraints,
                              rcm_vertex_order(vertices_resources, nets),
                              rcm_chip_order(machine))