dddd.java

计算强连通分支的算法实现

package 强连通分支;

import java.util.LinkedList;

public class dddd {

	/**
	 * @param args
	 */
	public static void main(String[] args) 
	{
		int   a[]={3,1,2};   
		  int   b[]={1,3,1};   
		  int   d[]={4,1,3};   
		  int   e[]={0,0,0,0,0,0,0};   
		  int   c[]={0,0,0,0,0};   
		  int   i,j,k;   
		  for(i=0;i<3;i++)   
		  { 
			  for(j=0;j<3;j++)   
		        c[i+j]=c[i+j]+a[i]*b[j];   
		      k=i+j-2;   
		  
		  for(i=0;i<3;i++)
		  for(j=0;j<=k;j++)   
		  e[i+j]=e[i+j]   +   c[j]*d[i];   }
		    
		  for(i=0;i<=6;i++)   
		  System.out.println(e[i]);   

		// TODO Auto-generated method stub

	}

}