We show several properties of the ordered dynamics. In particular, we give necessary and sufficient conditions which indicate when a transformation preserves the dynamics of the regional maxima. We also establish a link between the dynamics, minimum spanning trees, and component trees. At last, we propose a linear time algorithm for computing, given the component tree of a function, the dynamics of all its maxima.