emp7_11.cpp

该包是数据结构的实验软件,来源于合肥工业大学人工智能与数据挖掘实验室,用来实现数据结构.

#include"graph2.h"
#include"grary1.h"
   const int n=7;
    BB2 a;
    bb1 b;
    boolean visited[n+1];
    GrpArr ag;
    datagraph g1;
    int i,j,k,Num;

  void  getcc(int k,BB2& a)
    {int i,j,sss;
     if (k==n)
       {Num=num+1;
       gotoxy(1,1);
       cout<<'\007'<<"num="<<Num;
       getch();
      }
       else if( (k<n)&&(k>0))
	      {
	      for(i=1;i<=n;i++)
		    if( (!visited[i])&&(a[b[k]][i]==1))
		    {  visited[i]=true;
		       b[k+1]=i;
		       cur_gnode_onoff(g,i);
			put_elmn(ag,k+1,i,0);
			cur_elmn_onoff(ag,k+1);
		      int	q=getch();
			if(q==27)
				exit(0);
			else
			  {

			getcc(k+1,a);
			visited[i]=false;
			clear_GrpArr_elmn(ag,k+1);
			 cur_gnode_onoff(g,i);
			}
		     }
	   }
    }
    main()
    {
      for (i=1;i<=n;i++)
	      { for (j=1;j<=i ;j++)
		     {	a[i][j]=Trunc(2*random(1));
			cout<<a[i][j]<<" ";
			      a[j][i]=1-a[i][j];
		      }
		    a[i][i]=0;

	      }
	    trans_arrbb2_graph(a,n,g);

	   for (i=1; i<=n;i++)
	       visited[i]=false;
	    create_grp_Arrbb(ag,1,1,true,b,"aaa",1,n);
	    initial_GrpArr(ag);
	     move_GrpArr_mid(ag,getmaxx()/2,30);
	     clear_GrpArr(ag);

	   for (i=1;i<=n;i++)
	     {  b[1]=i;
		put_elmn(ag,1,i,0);
		cur_elmn_onoff(ag,1);
		visited[i]=true;
		cur_gnode_onoff(g,i);
		getch();
		window(1,1,80,2);
		Num=0;
		getcc(1,a);
		visited[i]=false;
		clear_GrpArr_elmn(ag,1);
		cur_gnode_onoff(g,i);
	   }
    }