Диплом / Новый текстовый документ

//#define L 3//количество ребер
//#define N 8//количество подграфов которые можно построить на данном графе
//int Start=1;//точка начала пути
//int Finish=2;//точка конца пути
//int Edges[L][3] = {{1,12,21}, //ребра графа
//{2,13,31}};
//{3,24,42},
//{4,25,52},
//{5,34,43},
//{6,35,53},
//{7,36,63},
//{8,45,54},
//{9,56,65},
//{10,57,75},
//{11,67,76}};






/*int *Edges = new int[100],*Connection = new int[100],*Data = new int[100],*Way = new int[100]; // Выделение памяти для массива
for (int i = 0; i < 100; i++)
{
Edges[i] = i;
Connection[i] = i;
Data[i] = i;
Way[i] =i;
for (int j=0;j<20;j++)
{
Edges[j] = j;
Connection[j] = j;
Data[j] = j;
}
//cout << "Value of " << i << " element is " << Edges[i] << endl;
//cout << "Value of " << i << " element is " << Connection[i] << endl;
//cout << "Value of " << i << " element is " << Data[i] << endl;
}
delete [] Edges;
delete [] Connection;
delete [] Data;
delete [] Way;*/