Скачиваний:
16
Добавлен:
28.06.2014
Размер:
2.44 Кб
Скачать
//---------------------------------------------------------------------------

#ifndef Unit1H
#define Unit1H
//---------------------------------------------------------------------------
#include <Classes.hpp>
#include <Controls.hpp>
#include <StdCtrls.hpp>
#include <Forms.hpp>
#include <ExtCtrls.hpp>
#include <Grids.hpp>
//---------------------------------------------------------------------------
class TForm1 : public TForm
{
__published:	// IDE-managed Components
        TImage *Image1;
        TStringGrid *StrGr1;
        TEdit *Edit1;
        TEdit *Edit2;
        TEdit *Edit3;
        TEdit *Edit4;
        TButton *Button1;
        TButton *Button2;
        TEdit *Edit5;
        TLabel *Label1;
        TLabel *Label2;
        TLabel *Label3;
        TLabel *Label4;
        TLabel *Label5;
    TButton *Button3;
        TButton *Button4;
        TEdit *Edit6;
    TButton *Button5;
        void __fastcall Button1Click(TObject *Sender);
        void __fastcall Button2Click(TObject *Sender);
        void __fastcall FormCreate(TObject *Sender);
        void __fastcall Button3Click(TObject *Sender);
        void __fastcall Button4Click(TObject *Sender);
    void __fastcall Button5Click(TObject *Sender);
private:	// User declarations
public:		// User declarations
        __fastcall TForm1(TComponent* Owner);
};
//---------------------------------------------------------------------------
extern PACKAGE TForm1 *Form1;
extern g=0;
extern m=1;

//---------------------------------------------------------------------------
#endif
void F(int A[100][100],int nver,int vn, int vk, int P,int cep[],int &f)
{
 int h = nver;
 int R[100];
 int St[100];
 int i, j, k, t, s,d;
 for (j=0;j<h+1;j++) R[j]=-1;
 j = -1; k = 0; St[k] = vn; R[vn] = 1; int kk=-1;  s=0;   f=0;
 do
  {
   t = St[k];
   do
   {
    j++;
    if (j>h)
     break;
   }
   while(A[t][j]<=0);
   if (j>h)
    {
     j = t;
     k--;
     R[t]=-1;
    }
   else
    if (R[j]<0)
     {
      k++;
      St[k] = j;
      R[j] = 1;
      if (j==vk)
       {
        s=0;
        for(i=1;i<k+1;i++)
         s = s + A[St[i-1]][St[i]];
        if (s<P)
         {
          for(i=kk+1,d=0;i<kk+k+2,d<k+1;i++,d++)
           cep[i] = St[d];
          cep[kk+k+2]=-1;
          f++;
          kk=k+1;
         }
       }
      j = -1;
     }
  }
  while(k>=0);
}
Соседние файлы в папке вот
  • #
    28.06.2014876 б15Project1.res
  • #
    28.06.20142.16 Mб15Project1.tds
  • #
    28.06.20146.19 Кб15Unit1.cpp
  • #
    28.06.201451 б15Unit1.ddp
  • #
    28.06.20143.86 Кб15Unit1.dfm
  • #
    28.06.20142.44 Кб16Unit1.h
  • #
    28.06.2014112.18 Кб15Unit1.obj
  • #
    28.06.20146.28 Кб15Unit1.~cpp
  • #
    28.06.201451 б15Unit1.~ddp
  • #
    28.06.20143.86 Кб15Unit1.~dfm
  • #
    28.06.20142.57 Кб15Unit1.~h