|
|
|
@ -1,73 +1,41 @@ |
|
|
|
using System; |
|
|
|
using System; |
|
|
|
using System.Diagnostics; |
|
|
|
|
|
|
|
using Combinatorics.Collections; |
|
|
|
|
|
|
|
using System.Collections.Generic; |
|
|
|
using System.Collections.Generic; |
|
|
|
|
|
|
|
using System.IO; |
|
|
|
using static System.Console; |
|
|
|
using static System.Console; |
|
|
|
using System.Threading.Tasks; |
|
|
|
|
|
|
|
using System.Threading; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
namespace komvo |
|
|
|
namespace komvo |
|
|
|
{ |
|
|
|
{ |
|
|
|
class Program |
|
|
|
class Program |
|
|
|
{ |
|
|
|
{ |
|
|
|
public static double[,] Matrix; |
|
|
|
public static List<Point> Points = new List<Point>(); |
|
|
|
public static bool End; |
|
|
|
|
|
|
|
public static bool EnabledPerm = false, EnabledAlg = false, EnabledAlgPar = false; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
public static int[] routesCPar; |
|
|
|
|
|
|
|
public static double[] routesResultsPar; |
|
|
|
|
|
|
|
public static int[][] routesCPars; |
|
|
|
|
|
|
|
public static int index; |
|
|
|
|
|
|
|
public static Thread CountThreads; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static void Main(string[] args) |
|
|
|
static void Main(string[] args) |
|
|
|
{ |
|
|
|
{ |
|
|
|
GetEnables(); |
|
|
|
string file = "coord.txt"; |
|
|
|
Beginig: |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
routesResultsPar = new double[10]; |
|
|
|
|
|
|
|
routesCPars = new int[10][]; |
|
|
|
|
|
|
|
index = 0; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
List<Point> Points = new List<Point>(); |
|
|
|
using (StreamReader cr = new StreamReader(file)) |
|
|
|
Random random = new Random(); |
|
|
|
|
|
|
|
int pCount = 0; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Retry: |
|
|
|
|
|
|
|
string elems = ReadLine(); |
|
|
|
|
|
|
|
//WriteLine($"Elems: {elems}"); |
|
|
|
|
|
|
|
try |
|
|
|
|
|
|
|
{ |
|
|
|
{ |
|
|
|
if (elems == "w") { GetEnables(); goto Retry; } |
|
|
|
string line; |
|
|
|
else |
|
|
|
while ((line = cr.ReadLine()) != null) |
|
|
|
{ |
|
|
|
|
|
|
|
pCount = Convert.ToInt32(elems); |
|
|
|
|
|
|
|
if (pCount < 4) { WriteLine("Слишком маленькое число"); goto Retry; } |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
catch |
|
|
|
|
|
|
|
{ |
|
|
|
{ |
|
|
|
Write("Введите натуральное число: "); |
|
|
|
string[] str = line.Split(); |
|
|
|
goto Retry; |
|
|
|
Points.Add(new Point { X = int.Parse(str[0]), Y = int.Parse(str[1]) }); |
|
|
|
|
|
|
|
WriteLine(str[0] + " " + str[1]); |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
for(int i = 0; i < pCount; i++) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
int x = random.Next(80); |
|
|
|
|
|
|
|
int y = random.Next(70); |
|
|
|
|
|
|
|
Points.Add(new Point { X = x, Y = y }); |
|
|
|
|
|
|
|
WriteLine("Точка {0} [{1};{2}]", i + 1, x, y); |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
WriteLine("\n"); |
|
|
|
WriteLine(); |
|
|
|
|
|
|
|
|
|
|
|
int matr = Points.Count; |
|
|
|
int matr = Points.Count; |
|
|
|
Matrix = new double[matr, matr]; |
|
|
|
double[,] Matrix = new double[matr, matr]; |
|
|
|
|
|
|
|
|
|
|
|
for (int i = 0; i < Points.Count; i++) |
|
|
|
for (int i = 0; i < Points.Count; i++) |
|
|
|
|
|
|
|
{ |
|
|
|
for (int j = i; j < Points.Count - 1; j++) |
|
|
|
for (int j = i; j < Points.Count - 1; j++) |
|
|
|
|
|
|
|
{ |
|
|
|
Matrix[i, j + 1] = Matrix[j + 1, i] = |
|
|
|
Matrix[i, j + 1] = Matrix[j + 1, i] = |
|
|
|
Math.Sqrt(Math.Pow(Points[j + 1].X - Points[i].X, 2) + Math.Pow(Points[j + 1].Y - Points[i].Y, 2)); |
|
|
|
Math.Sqrt(Math.Pow(Points[j + 1].X - Points[i].X, 2) + Math.Pow(Points[j + 1].Y - Points[i].Y, 2)); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
for (int i = 0; i < matr; i++) |
|
|
|
for (int i = 0; i < matr; i++) |
|
|
|
{ |
|
|
|
{ |
|
|
|
@ -75,348 +43,157 @@ namespace komvo |
|
|
|
WriteLine(); |
|
|
|
WriteLine(); |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
string formP = string.Empty; |
|
|
|
|
|
|
|
for (int i = 2; i <= Points.Count; i++) formP += i.ToString(); |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int fct = Fact(Points.Count - 1); |
|
|
|
|
|
|
|
WriteLine("{0} {1}", formP, fct); |
|
|
|
|
|
|
|
WriteLine("\n\n"); |
|
|
|
|
|
|
|
|
|
|
|
//------------------------------------------------------------------------------------------------- |
|
|
|
int[] routes = new int[fct]; |
|
|
|
#region Permuts |
|
|
|
double[] leng = new double[fct]; |
|
|
|
|
|
|
|
|
|
|
|
if (!EnabledPerm) goto EndOfPerm; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Stopwatch stopwatchPERM = new Stopwatch(); |
|
|
|
|
|
|
|
stopwatchPERM.Start(); |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
List<ResultRoute> resroutesPerm = new List<ResultRoute>(); |
|
|
|
|
|
|
|
int[] toSwap = new int[Points.Count - 1]; |
|
|
|
|
|
|
|
for (int i = 0; i <= toSwap.Length - 1; i++) toSwap[i] = i + 2; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
bool first = true; |
|
|
|
int waves = fct / 6; |
|
|
|
double opLength = 0, prevResult = 0; |
|
|
|
|
|
|
|
string opRoute = string.Empty; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Permutations<int> perm = new Permutations<int>(toSwap); |
|
|
|
int cn = 1, cn2 = 0; |
|
|
|
foreach(IList<int> p in perm) |
|
|
|
string inf = formP; |
|
|
|
{ |
|
|
|
for (int i = 1; i < waves + 1; i++) |
|
|
|
int[] route = new int[Points.Count - 1]; |
|
|
|
|
|
|
|
for (int i = 0; i < toSwap.Length; i++) route[i] = p[i]; |
|
|
|
|
|
|
|
prevResult = CountLength(Matrix, route); |
|
|
|
|
|
|
|
//WriteLine(opLength); |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
if (first) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
opLength = prevResult; |
|
|
|
|
|
|
|
foreach (int i in route) opRoute += i + ";"; |
|
|
|
|
|
|
|
first = false; |
|
|
|
|
|
|
|
resroutesPerm.Add(new ResultRoute(opLength, opRoute)); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
else if(opLength > prevResult) |
|
|
|
|
|
|
|
{ |
|
|
|
{ |
|
|
|
opLength = prevResult; |
|
|
|
for(int j = 0; j < 6; j++) |
|
|
|
opRoute = string.Empty; |
|
|
|
|
|
|
|
foreach (int i in route) opRoute += i + ";"; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
resroutesPerm.Clear(); |
|
|
|
|
|
|
|
resroutesPerm.Add(new ResultRoute(opLength, opRoute)); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
else if(opLength == prevResult) |
|
|
|
|
|
|
|
{ |
|
|
|
{ |
|
|
|
opRoute = string.Empty; |
|
|
|
if (i == 0 && j == 0) { routes[j + (i - 1) * 6] = int.Parse(formP); WriteLine(routes[j + (i - 1) * 6]); } |
|
|
|
foreach (int i in route) opRoute += i + ";"; |
|
|
|
else if (j % 2 == 0) { routes[j + (i - 1) * 6] = int.Parse(formP = Swap(formP, 0, j / 2)); WriteLine(routes[j + (i - 1) * 6]); } |
|
|
|
resroutesPerm.Add(new ResultRoute(opLength, opRoute)); |
|
|
|
else { routes[j + (i - 1) * 6] = int.Parse(Swap(formP, 1, 2)); WriteLine(routes[j + (i - 1) * 6]); } |
|
|
|
} |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
stopwatchPERM.Stop(); |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
WriteLine("\n\nPerms"); |
|
|
|
|
|
|
|
WriteLine("1;{1}1 - оптимальный маршрут длинной {0:00.00}\nИз {2} маршрутов при {3} точках\nПосчитано за {4} \n\n", |
|
|
|
|
|
|
|
opLength, opRoute, Fact(Points.Count - 1), Points.Count, stopwatchPERM.Elapsed); |
|
|
|
|
|
|
|
//WriteLine($"Count = {resroutesPerm.Count}"); |
|
|
|
|
|
|
|
EndOfPerm: |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#endregion |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//------------------------------------------------------------------------------------------------- |
|
|
|
if (waves > 1) |
|
|
|
#region Alg |
|
|
|
{ |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
if (!EnabledAlg) goto ExitFromAlg; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Stopwatch stopwatchNAl = new Stopwatch(); |
|
|
|
|
|
|
|
stopwatchNAl.Start(); |
|
|
|
|
|
|
|
int[] routesC = new int[Points.Count - 1]; |
|
|
|
|
|
|
|
for (int i = 0; i < routesC.Length; i++) routesC[i] = i + 2; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
routesC[routesC.Length - 1]--; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
End = false; |
|
|
|
|
|
|
|
bool firstIt = true; |
|
|
|
|
|
|
|
double routeLen = 0; |
|
|
|
|
|
|
|
string routeName = string.Empty; |
|
|
|
|
|
|
|
int routesCount = 0; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
for (int numb = 0; numb < Math.Pow(Points.Count - 1, Points.Count - 1); numb++) |
|
|
|
if (i % 4 == 0 && waves > 4) |
|
|
|
{ |
|
|
|
|
|
|
|
routesC[routesC.Length - 1] += 1; |
|
|
|
|
|
|
|
Adjustment(ref routesC); |
|
|
|
|
|
|
|
if (!End) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
if (CheckDoubles(routesC)) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
//Write($"{CountLength(Matrix, routesC):00.00} ;"); |
|
|
|
|
|
|
|
routesCount += 1; |
|
|
|
|
|
|
|
if (firstIt) |
|
|
|
|
|
|
|
{ |
|
|
|
{ |
|
|
|
routeLen = CountLength(Matrix, routesC); |
|
|
|
formP = Swap(formP, cn2++, 4); |
|
|
|
foreach (int i in routesC) routeName += i + ";"; |
|
|
|
WriteLine("{0} {1}", formP, inf); |
|
|
|
firstIt = false; |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
else |
|
|
|
else |
|
|
|
{ |
|
|
|
{ |
|
|
|
if (routeLen > CountLength(Matrix, routesC)) |
|
|
|
switch (cn) |
|
|
|
{ |
|
|
|
{ |
|
|
|
routeLen = CountLength(Matrix, routesC); |
|
|
|
case 1: |
|
|
|
routeName = string.Empty; |
|
|
|
formP = Swap(formP, '2', '5'); |
|
|
|
foreach (int i in routesC) routeName += i + ";"; |
|
|
|
cn++; |
|
|
|
} |
|
|
|
break; |
|
|
|
} |
|
|
|
case 2: |
|
|
|
} |
|
|
|
formP = Swap(formP, '3', '2'); |
|
|
|
|
|
|
|
cn++; |
|
|
|
|
|
|
|
break; |
|
|
|
|
|
|
|
case 3: |
|
|
|
|
|
|
|
formP = Swap(formP, '4', '3'); |
|
|
|
|
|
|
|
cn++; |
|
|
|
|
|
|
|
break; |
|
|
|
|
|
|
|
default: |
|
|
|
|
|
|
|
WriteLine("???????"); |
|
|
|
|
|
|
|
break; |
|
|
|
} |
|
|
|
} |
|
|
|
else { goto EndOfAlg; } |
|
|
|
if (cn > 3) cn = 1; |
|
|
|
|
|
|
|
//formP = Swap(inf, cn++, 3); |
|
|
|
|
|
|
|
//WriteLine("{0} {1}", formP, inf); |
|
|
|
} |
|
|
|
} |
|
|
|
stopwatchNAl.Stop(); |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
EndOfAlg: |
|
|
|
|
|
|
|
WriteLine("Algoritm"); |
|
|
|
|
|
|
|
WriteLine($"1;{routeName}1 - оптимальный маршрут длинной {routeLen:00.00}\n" + |
|
|
|
|
|
|
|
$"Из {routesCount} маршрутов при {Points.Count} точках\nПосчитано за {stopwatchNAl.Elapsed} \n\n"); |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
ExitFromAlg: |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#endregion |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//if (cn > 4) |
|
|
|
//------------------------------------------------------------------------------------------------- |
|
|
|
|
|
|
|
#region AlgParall |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
if (!EnabledAlgPar) goto EndOfAlgParExiting; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Stopwatch stopwatchNAlPar = new Stopwatch(); |
|
|
|
|
|
|
|
stopwatchNAlPar.Start(); |
|
|
|
|
|
|
|
routesCPar = new int[Points.Count - 1]; |
|
|
|
|
|
|
|
for (int i = 0; i < routesCPar.Length; i++) routesCPar[i] = i + 2; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
routesCPar[routesCPar.Length - 1]--; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
End = false; |
|
|
|
|
|
|
|
string routeNamePar = string.Empty; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
for (int numb = 0; numb < Math.Pow(Points.Count - 1, Points.Count - 1); numb++) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
routesCPar[routesCPar.Length - 1] += 1; |
|
|
|
|
|
|
|
Adjustment(ref routesCPar); |
|
|
|
|
|
|
|
if (!End) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
if (CheckDoubles(routesCPar)) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
if (CountThreads != null) |
|
|
|
|
|
|
|
if (CountThreads.IsAlive) CountThreads.Join(); |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
routesCPars[index] = new int[routesCPar.Length]; |
|
|
|
|
|
|
|
routesCPar.CopyTo(routesCPars[index], 0); |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
index++; |
|
|
|
|
|
|
|
if (index > 9) index = 0; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//Write($"\n{index} : "); |
|
|
|
|
|
|
|
//foreach (int i in routesCPars[index]) Write($"{i}; "); |
|
|
|
|
|
|
|
CountThreads = new Thread(() => CountLengthParall()); |
|
|
|
|
|
|
|
CountThreads.Start(); |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
//if (CountThreads1 == null) |
|
|
|
|
|
|
|
//{ |
|
|
|
//{ |
|
|
|
// CountThreads1 = new Thread(() => CountLengthParall()); |
|
|
|
// cn = 0; |
|
|
|
// CountThreads1.Start(); |
|
|
|
// formP = Swap(inf, cn2, 4); |
|
|
|
//} |
|
|
|
// cn2++; |
|
|
|
//else if (!CountThreads1.IsAlive) |
|
|
|
|
|
|
|
//{ |
|
|
|
|
|
|
|
// CountThreads1 = new Thread(() => CountLengthParall()); |
|
|
|
|
|
|
|
// CountThreads1.Start(); |
|
|
|
|
|
|
|
//} |
|
|
|
//} |
|
|
|
//else |
|
|
|
//else |
|
|
|
//{ |
|
|
|
//{ |
|
|
|
// CountThreads1.Join(); |
|
|
|
//formP = Swap(inf, cn, 3); |
|
|
|
// CountThreads1 = new Thread(() => CountLengthParall()); |
|
|
|
|
|
|
|
// CountThreads1.Start(); |
|
|
|
|
|
|
|
//} |
|
|
|
//} |
|
|
|
|
|
|
|
//cn++; |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
else { goto EndOfAlgPar; } |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
stopwatchNAlPar.Stop(); |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
EndOfAlgPar: |
|
|
|
CountLen(ref leng, Matrix, routes); |
|
|
|
|
|
|
|
|
|
|
|
CountThreads.Join(); |
|
|
|
double optim = leng[0]; |
|
|
|
double ddd = routesResultsPar[0]; |
|
|
|
int oIndex = 0; |
|
|
|
for(int i = 0; i < 10; i++) |
|
|
|
for (int i = 0; i < leng.Length; i++) |
|
|
|
{ |
|
|
|
{ |
|
|
|
if (ddd > routesResultsPar[i] & routesResultsPar[i] != 0) ddd = routesResultsPar[i]; |
|
|
|
WriteLine("{0:N2} - {1}", leng[i], routes[i]); |
|
|
|
|
|
|
|
if (optim > leng[i]) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
optim = leng[i]; |
|
|
|
|
|
|
|
oIndex = i; |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
WriteLine("Paralle Alg"); |
|
|
|
|
|
|
|
//foreach (double d in routesResultsPar) Write($"{d:00.00}; "); WriteLine(); |
|
|
|
|
|
|
|
WriteLine($"Result: {ddd:00.00}; Time: {stopwatchNAlPar.Elapsed}"); |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
EndOfAlgParExiting: |
|
|
|
for (int i = 0; i < routes.Length; i++) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
for (int j = i + 1; j < routes.Length - 1; j++) |
|
|
|
|
|
|
|
if (routes[i].Equals(routes[j])) WriteLine("{0} {2}:: {1} {3}!!!!", routes[i], routes[j], i, j); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
WriteLine("\n\n1{1}1 - оптимальный маршрут длинной {0:00.00}\nВсего маршрутов {2}\n{4} {3}", |
|
|
|
|
|
|
|
optim, routes[oIndex], routes.Length, fct, Points.Count); |
|
|
|
|
|
|
|
|
|
|
|
#endregion |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Write("Ещё раз? (y/n) "); |
|
|
|
|
|
|
|
Exiting: |
|
|
|
|
|
|
|
char answer = ReadKey().KeyChar; |
|
|
|
|
|
|
|
switch (answer) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
case 'y': |
|
|
|
|
|
|
|
Write("\nВведите количество точек больше 3 (w для изменения алгоритммов): "); |
|
|
|
|
|
|
|
goto Beginig; |
|
|
|
|
|
|
|
case 'n': |
|
|
|
|
|
|
|
goto End; |
|
|
|
|
|
|
|
default: |
|
|
|
|
|
|
|
goto Exiting; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
End: |
|
|
|
|
|
|
|
WriteLine("\nРабота окончена"); |
|
|
|
|
|
|
|
Thread.Sleep(1000); |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
public static void Adjustment(ref int[] route) |
|
|
|
//WriteLine(Fact(5)); |
|
|
|
{ |
|
|
|
//MessageBox.Show(Math.Sqrt(-1).ToString()); |
|
|
|
for (int i = route.Length - 1; i >= 0; i--) |
|
|
|
ReadKey(); |
|
|
|
{ |
|
|
|
|
|
|
|
if (route[i] > route.Length + 1) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
if (i == 0) { End = true; /*WriteLine("\nEnded");*/ break; } |
|
|
|
|
|
|
|
else |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
route[i] = 2; |
|
|
|
|
|
|
|
route[i - 1] += 1; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
public static double CountLength(double[,] mtr, int[] route) |
|
|
|
public static string Swap(string value, int first, int second) |
|
|
|
{ |
|
|
|
{ |
|
|
|
double result = 0; |
|
|
|
char[] res = value.ToCharArray(); |
|
|
|
|
|
|
|
res[first] = value[second]; |
|
|
|
|
|
|
|
res[second] = value[first]; |
|
|
|
|
|
|
|
value = new string(res); |
|
|
|
|
|
|
|
|
|
|
|
for (int j = 0; j < route.Length - 1; j++) |
|
|
|
return value; |
|
|
|
{ |
|
|
|
|
|
|
|
if (j == 0) result += mtr[0, route[j] - 1]; |
|
|
|
|
|
|
|
else if (j == route.Length - 1) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
result += mtr[route[j - 1] - 2, route[j] - 2]; |
|
|
|
|
|
|
|
result += mtr[0, route[j] - 2]; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
else |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
result += mtr[route[j - 1] - 2, route[j] - 2]; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
return result; |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
public static void CountLengthParall() |
|
|
|
public static string Swap(string value, char first, char second) |
|
|
|
{ |
|
|
|
{ |
|
|
|
double result = 0; |
|
|
|
int f, s; |
|
|
|
int indexL = index - 1; |
|
|
|
char[] res = value.ToCharArray(); |
|
|
|
if (indexL == -1) indexL = 9; |
|
|
|
WriteLine(f = value.IndexOf(first)); |
|
|
|
//WriteLine($"Index: {index}"); |
|
|
|
WriteLine(s = value.IndexOf(second)); |
|
|
|
int[] localRoute = routesCPars[indexL]; |
|
|
|
res[value.IndexOf(first)] = value[value.IndexOf(second)]; |
|
|
|
|
|
|
|
res[value.IndexOf(second)] = value[value.IndexOf(first)]; |
|
|
|
|
|
|
|
value = new string(res); |
|
|
|
|
|
|
|
|
|
|
|
for (int j = 0; j < localRoute.Length - 1; j++) |
|
|
|
return value; |
|
|
|
{ |
|
|
|
|
|
|
|
if (j == 0) result += Matrix[0, localRoute[j] - 1]; |
|
|
|
|
|
|
|
else if (j == localRoute.Length - 1) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
result += Matrix[localRoute[j - 1] - 2, localRoute[j] - 2]; |
|
|
|
|
|
|
|
result += Matrix[0, localRoute[j] - 2]; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
else |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
result += Matrix[routesCPars[indexL][j - 1] - 2, routesCPars[indexL][j] - 2]; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
if(routesResultsPar[index] == 0 || routesResultsPar[index] > result) routesResultsPar[index] = result; |
|
|
|
|
|
|
|
//index++; |
|
|
|
|
|
|
|
//if (index > 9) index = 0; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
public static bool CheckDoubles(int[] array) |
|
|
|
public static void CountLen (ref double[] result, double[,] mtr, int[] rts) |
|
|
|
{ |
|
|
|
|
|
|
|
int count = array.Length; |
|
|
|
|
|
|
|
//for (int i = 0; i < count; i++) Write(array[i] + " "); WriteLine(); |
|
|
|
|
|
|
|
for(int i = 0; i < count; i++) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
for(int j = i + 1; j < count; j++) |
|
|
|
|
|
|
|
{ |
|
|
|
{ |
|
|
|
//WriteLine($"{array[i]}[{i}] == {array[j]}[{j}] = {array[i] == array[j]}"); |
|
|
|
for (int i = 0; i < rts.Length; i++) |
|
|
|
|
|
|
|
|
|
|
|
if (array[i] == array[j]) |
|
|
|
|
|
|
|
{ |
|
|
|
{ |
|
|
|
return false; |
|
|
|
double res = 0; |
|
|
|
} |
|
|
|
char[] ch = rts[i].ToString().ToCharArray(); |
|
|
|
} |
|
|
|
for (int j = 0; j < ch.Length; j++) |
|
|
|
} |
|
|
|
|
|
|
|
return true; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
public static bool YesOrNo(char ch) |
|
|
|
|
|
|
|
{ |
|
|
|
{ |
|
|
|
switch (ch) |
|
|
|
if (j == 0) res += mtr[0, int.Parse(ch[j].ToString()) - 1]; |
|
|
|
|
|
|
|
else if (j == ch.Length - 1) |
|
|
|
{ |
|
|
|
{ |
|
|
|
case 'y': |
|
|
|
res += mtr[int.Parse(ch[j - 1].ToString()) - 1, int.Parse(ch[j].ToString()) - 1]; |
|
|
|
return true; |
|
|
|
res += mtr[0, int.Parse(ch[j].ToString()) - 1]; |
|
|
|
case 'n': |
|
|
|
|
|
|
|
return false; |
|
|
|
|
|
|
|
default: |
|
|
|
|
|
|
|
return false; |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
else |
|
|
|
|
|
|
|
|
|
|
|
public static void GetEnables() |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
GetEnables: |
|
|
|
|
|
|
|
Write("\nКакие алгоритмы включить (например yny: Perm: Enbled, Alg: Disabled, AlgPar: Enabled)? : "); |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
char[] check = ReadLine().ToCharArray(); |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
for (int i = 0; i < check.Length; i++) |
|
|
|
|
|
|
|
{ |
|
|
|
{ |
|
|
|
if (i == 0) EnabledPerm = YesOrNo(check[i]); |
|
|
|
res += mtr[int.Parse(ch[j - 1].ToString()) - 1, int.Parse(ch[j].ToString()) - 1]; |
|
|
|
if (i == 1) EnabledAlg = YesOrNo(check[i]); |
|
|
|
|
|
|
|
if (i == 2) EnabledAlgPar = YesOrNo(check[i]); |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
//EnabledAlgPar = false; |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
WriteLine($"Permutation Alg Enabled = {EnabledPerm}\nFull Alg Enabled = {EnabledAlg}\nFull Alg Parallel Enabled = {EnabledAlgPar}"); |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
if (EnabledPerm == EnabledAlg & EnabledAlg == EnabledAlgPar & EnabledAlgPar == false) { WriteLine("Неверно введены параметры"); goto GetEnables; } |
|
|
|
|
|
|
|
Write("\nВведите количество точек больше 3 (w для изменения алгоритммов): "); |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
result[i] = res; |
|
|
|
public class ResultRoute |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
double length; |
|
|
|
|
|
|
|
string route; |
|
|
|
|
|
|
|
public ResultRoute(double len, string route) |
|
|
|
|
|
|
|
{ |
|
|
|
|
|
|
|
length = len; |
|
|
|
|
|
|
|
this.route = route; |
|
|
|
|
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
@ -426,6 +203,7 @@ namespace komvo |
|
|
|
public int Y { get; set; } |
|
|
|
public int Y { get; set; } |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static int Fact(int a) => a <= 1 ? 1 : a * Fact(a - 1); |
|
|
|
static int Fact(int a) => a <= 1 ? 1 : a * Fact(a - 1); |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
} |
