GeneticAlgorithmAndCom/createRoute.py at main · ermakov-dmitry/GeneticAlgorithmAndCom · GitHub

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
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import geneticAlgo
import csv

iteration = 200
childs = 50
mut = 70
filename = 'mediumTopology.csv'

# small: 0 - 7
# medium: 0 - 11

number_of_points = input('Please enter number of points of route: ')
number_of_points = int(number_of_points)
points = []
for i in range(number_of_points):
    points.append(int(input('Enter number of {0} point: '.format(i + 1))))

matrix = []

for i in range(number_of_points):
    matrix.append([None] * number_of_points)

for i in range(number_of_points):
    for j in range(i, number_of_points):
        if i == j:
            matrix[i][j] = [0], 0
        else:
            matrix[i][j] = geneticAlgo.findShortestPath(filename, iteration, childs, mut, points[i], points[j])
            reverse_path = matrix[i][j][0].copy()
            reverse_path.reverse()
            matrix[j][i] = reverse_path, matrix[i][j][1]

with open("ourRouteTopology.csv", mode="w", encoding='utf-8') as w_file:
    file_writer = csv.writer(w_file, delimiter=",", lineterminator="\r")
    for i in range(len(matrix[0])):
        row_csv = []
        for j in range(len(matrix[0])):
            row_csv.append(matrix[i][j][1])
        file_writer.writerow(row_csv)

# print('Choose start point from route point -', end='')
# for x in points:
#     print(' ', end='')
#     print(x, end='')
# print(':', end=' ')
# start_point = input()
# start_point = int(start_point)
start_point = points[0]
idx_start_point_in_matrix = 0
for i in range(number_of_points):
    if points[i] == start_point:
        idx_start_point_in_matrix = i
        break

if points.count(start_point) == 0:
    raise Exception('Not found start point')

print()