information.java

粗糙集算法的实现 麻烦高手帮我连通,去年的逼设,应该可以用,但我太菜不会!

package roughreduct;
import java.sql.*;
import rough.Rough_reduct_wj;
public class Information
{
  public String leibie[][];
  public String db_info[][];
  public int decision_table[][];
  public int row;
  public int colum;
  public void init(ResultSet rs)
  {
  try
   {
    int i,j;
    ResultSetMetaData rsmd =rs.getMetaData();
    colum=rsmd.getColumnCount();
    row=0;
    while(rs.next()) row++;
    leibie=new String[row][colum];
    decision_table=new int[row][colum];
    db_info=new String[row][colum];
    for(i=0;i<row;i++)
    for(j=0;j<colum;j++)
       decision_table[i][j]=-1;
    } 
   catch(SQLException e)
    {
     System.err.println(e);
    }
 }
 public void cal_reduct(ResultSet rs)
  //计算决策表和保存类别信息,并进行粗糙集约简
  { 
   try
    {
     int i,j,k,m;
     //读取数据库中的信息以便操作
     i=0;
     while(rs.next())
     { 
      for(j=0;j<colum;j++)
      db_info[i][j]=rs.getString(j+1);
      i++;
     }
     System.out.println(row);
//求粗糙集决策表decision_table[m][n]及保存数据库中各列的类别，以便在界面显示
     for(j=0;j<colum;j++)
     {
       m=0;
       for(i=0;i<row-1;i++)
       {
        if(decision_table[i][j]==-1)
         {
          leibie[m][j]=db_info[i][j];
          decision_table[i][j]=m;
          for(k=i+1;k<row;k++)
           {
            if(db_info[i][j].equals(db_info[k][j]))
            decision_table[k][j]=m;
           }///////
          m++;
         }
       }
      if(decision_table[i][j]==-1) 
      {
        decision_table[i][j]=m;
        leibie[m][j]=db_info[i][j];
      }
     }
  //粗糙集约简
   Rough_reduct_wj a=new Rough_reduct_wj();
   a.rough_reduct(decision_table,colum-1,row,colum);
  }
  catch(SQLException e)
   {
    System.err.println(e);
   }
 }
};