import java.applet.Applet;
import java.awt.event.*;
import java.awt.*;
import java.util.Arrays;

public class EvolveRigid {
  


     public static Complex[] evolve(SpanningTree ST,Complex[] Z,int COUNT,double step) {
	Complex[] W=new Complex[COUNT];
	for(int i=0;i<COUNT;++i) W[i]=evolve0(ST,Z,i,step);
	return(W);
     }


    public static Complex evolve0 (SpanningTree ST,Complex[] Z,int i0,double step) {
	int[] q=ST.pathToRoot(i0);
	int s=q.length;
	int[] r=new int[s];
	for(int i=0;i<s;++i) r[i]=q[s-1-i];
	Complex[] W=new Complex[s];
	for(int i=0;i<s;++i) W[i]=Z[r[i]];
	for(int j=0;j<s;++j) {
	    for(int k=j+1;k<s;++k) {
		double step2=step*Math.pow(.95,s);
		W[k]=TreeFunctions.rotate(W[j],W[k],step);
	    }
	}
	return(W[s-1]);
    }




}