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

public class EvolveFlex {
  


    public static Complex[] evolve1(SpanningTree ST,Complex[] Z,int COUNT,double step) {
	double average=ST.getTreeWeight()/(COUNT-1);
	Complex[] W=new Complex[COUNT];
	for(int i=0;i<COUNT;++i) W[i]=evolve10(ST,Z,i,average,step);
	return(W);
    }

    public static Complex evolve10(SpanningTree ST,Complex[] Z,int i, double average,double step) {
	Complex z1=Z[i];
	int j=ST.P[i][1];
	if(j==-1) return(z1);
	Complex z2=Z[j];
	double d=step*(-Complex.dist(z1,z2)+average);
	Complex z3=new Complex((1+d)*z1.x-d*z2.x,(1+d)*z1.y-d*z2.y);
	return(z3);
    }




    public static Complex[] evolve2(SpanningTree ST,Complex[] Z,int COUNT,double step) {
	Complex[] W=new Complex[COUNT];
	for(int i=0;i<COUNT;++i) W[i]=evolve20(ST,Z,i,step);
	W=TreeFunctions.rescale(W,COUNT);
	return(W);
    }

    public static Complex evolve20(SpanningTree ST,Complex[] Z,int i, double step) {
	Complex z1=Z[i];
	int j=ST.P[i][1];
	if(j==-1) return(z1);
	Complex z2=Z[j];
	return(TreeFunctions.rotate(z2,z1,step));
    }



}