1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
| using System;
using System.Collections.Generic;
using System;
using System.Collections.Concurrent;
using System.Diagnostics;
using System.Linq;
using System.Threading.Tasks;
using System.Diagnostics;
using System.Threading;
using System.Linq;
using System.Text;
namespace paralelniiGraf
{
public struct Graf2
{
public int collorKode;
public int kod;
public int[] Neighbors;
}
class Program
{
private Object thisLock = new Object();
static Graf2[] BigGraf;
static int NumberOfCollors(Graf2[] Gr)//метод для подсчета минимального числа цветов для раскраски вершин графа
{
int Number = 0;//число colors
int stop = 0;// to stop cicle of founding collor
for (int i = 0; i < Gr.Length; i++) //проходим по всем вершинам, не возвращаясь
{
do//ищем свободный номер цвета
{
stop = 0;
for (int j = 0; j < Gr[i].Neighbors.Length; j++)
{
if ((Gr[i].collorKode == Gr[Gr[i].Neighbors[j]].collorKode) & (i != Gr[i].Neighbors[j]))//сверяем цветовой код с соседями, учитывая петлю(когда сосед ета же вершина)
{
Gr[i].collorKode = Gr[i].collorKode + 1;
stop = 1;
}
}
}
while (stop == 1);
}
Number = 0;//пишем число цветов исходя из кода максимального из них
for (int i = 0; i < Gr.Length; i++)
{
if (Gr[i].collorKode > Number)
{
Number = Gr[i].collorKode;
}
}
return Number + 1;
}
static void Main(string[] args)
{
double sum = 0, time = 0, midl = 0, sigma = 0, pogreshnost, student = 2.6;
double pogre;
double[] mas;
/* Graf2[] A = new Graf2[6];
for (int i = 0; i < A.Length; i++)
{ A[i].kod = i; }
A[0].Neighbors=new int []{0,1,2,3};
A[1].Neighbors = new int[]{0,4};
A[2].Neighbors = new int[] { 0,5,3};
A[3].Neighbors = new int[] { 0,2 };
A[4].Neighbors = new int[] { 1 };
A[5].Neighbors = new int[] { 2};*/
/*A[0].Neighbors = new int[] { 0, 1, 2, 3 };
A[1].Neighbors = new int[] { 0, 4 };
A[2].Neighbors = new int[] { 0, 5, 3 };
A[3].Neighbors = new int[] { 0, 2, 5 };
A[4].Neighbors = new int[] { 1, 5 };
A[5].Neighbors = new int[] { 2, 3, 4 };
/* for (int i = 0; i < A.Length; i++)*/
/* { Console.WriteLine(" A[" + i + "].kod=" + A[i].kod); }*/
/* Console.WriteLine();
Console.WriteLine("AAAAAAA");
for (int i = 0; i < A.Length; i++)//smotrim nash graf
{
for(int j=0;j<A[i].Neighbors.Length;j++)
{
Console.WriteLine(A[i].Neighbors[j]);
}
Console.WriteLine("----");
}
Console.WriteLine("====");
Console.WriteLine(NumberOfCollors(A));*/
int all = 8;
mas = new double[all];
for (double id = 1; id < all; id++)
{
Stopwatch stopWatch = new Stopwatch();
stopWatch.Start();
Random rnd = new Random(DateTime.Now.Millisecond);
/*for (int i = 0; i < 10; i++)
{
Console.WriteLine(rnd.Next(10));
}*/
int n = 2500;
/* Graf2[] B = new Graf2[n];
for (int i = 0; i < n; i++)
{
B[i].Neighbors = new int[rnd.Next(n)];
}*/
int[,] Osnova = new int[n, n];
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
Osnova[i, j] = rnd.Next(0, 2);
}
}
// Console.WriteLine("sozdadim sluchainuiu matricu");
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if (Osnova[i, j] == 0)
{
Osnova[j, i] = 0;
}
else
{
Osnova[j, i] = 1;
}
}
}
/* for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
Console.Write(Osnova[i, j] + " ");
}
Console.WriteLine();
}*/
// Console.WriteLine("Teperzapishem po matrice sosedei");
BigGraf = new Graf2[n];
int count = 0;// chtob znat skolko sosedei u versini
int rahivnikOfNeighbors;
for (int i = 0; i < n; i++)
{
count = 0;
for (int j = 0; j < n; j++)
{
if (Osnova[i, j] == 1)
{
count++;
}
}
BigGraf[i].Neighbors = new int[count];
rahivnikOfNeighbors = 0;
for (int j = 0; j < n; j++)
{
if (Osnova[i, j] == 1)
{
BigGraf[i].Neighbors[rahivnikOfNeighbors] = j;
rahivnikOfNeighbors++;
}
}
}
/* Console.WriteLine("AAAAAAA");
for (int i = 0; i < BigGraf.Length; i++)//smotrim nash graf
{
for (int j = 0; j < BigGraf[i].Neighbors.Length; j++)
{
Console.WriteLine(BigGraf[i].Neighbors[j]);
}
Console.WriteLine("----");
}*/
// Console.WriteLine("[[[[[[[}}}}}}}");
Console.WriteLine(NumberOfCollors(BigGraf));
TimeSpan ts = stopWatch.Elapsed;
string elapsedTime = String.Format("{0:00}:{1:00}:{2:00}.{3:00}", ts.Hours, ts.Minutes, ts.Seconds,
ts.Milliseconds / 10);
sum = sum + ts.Milliseconds / 10 + ts.Seconds * 100;
Console.WriteLine("RunTime " + elapsedTime);
time = ts.Milliseconds / 10 + ts.Seconds * 100;
mas[int.Parse(id.ToString())] = time;
midl = sum / id;
// double id12 = id - 1;
// sigma = ((midl - time) *(midl - time))/(id*id12);// / (id * (id - 1));
// sigma = (sigma+(1 * ((midl - time) * (midl - time)) / (id * (id - 1))));
pogreshnost = student * Math.Sqrt(sigma);
// Console.WriteLine("id" + id);
Console.WriteLine("run time" + time);
Console.WriteLine("sum time" + sum);
//Console.WriteLine("midl"+midl);
//Console.WriteLine("sigma=" + sigma);
//Console.WriteLine("=======");
//Console.WriteLine("pogreshnost=" + (pogreshnost/midl)*100);
//Console.WriteLine("=======");
}
Console.WriteLine(" Time " + sum);
sum = 0;
Console.WriteLine("=====");
for (int i = 1; i < all; i++)
{
Console.WriteLine(mas[i]);
sum = sum + mas[i];
}
midl = sum / (all - 1);
sigma = 0;
for (int i = 1; i < all; i++)
{
sigma = sigma + (midl - mas[i]) * (midl - mas[i]);
}
sigma = sigma / ((all - 1) * (all - 2));
sigma = Math.Sqrt(sigma);
pogre = sigma * 1.8946;
Console.WriteLine(sum);
Console.WriteLine("all" + (all - 1));
Console.WriteLine("midl" + midl);
Console.WriteLine("sigma" + sigma);
Console.WriteLine("pogre" + pogre * 100 / midl);
Console.ReadLine();
}
}
} |
(
