-
Notifications
You must be signed in to change notification settings - Fork 0
/
Utils.py
140 lines (110 loc) · 5.53 KB
/
Utils.py
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
import random
import math
from tsplib95 import distances
import networkx
import Graph, Node, Edge
from typing import List
class Utils:
INITIALPOINT = "nodoInicial"
FINALPOINT = "nodoFinal"
FEROMONERATE = "taxaFeromona"
DISTANCE = "distancia"
EDGES = "edges"
EDGE1 = "edge1"
EDGE2 = "edge2"
EDGE3 = "edge3"
EDGE4 = "edge4"
NODEA = "nodeA"
NODEB = "nodeB"
NODEC = "nodeC"
NODED = "nodeD"
NODEE = "nodeE"
dictA = {INITIALPOINT : 'A', EDGE1 : {INITIALPOINT: 'A', FINALPOINT: 'B', DISTANCE: 2, FEROMONERATE : 0.1},
EDGE2 : {INITIALPOINT: 'A', FINALPOINT: 'C', DISTANCE: 5, FEROMONERATE: 0.1},
EDGE3 : {INITIALPOINT: 'A', FINALPOINT: 'D', DISTANCE: 5, FEROMONERATE: 0.2},
EDGE4 : {INITIALPOINT: 'A', FINALPOINT: 'E', DISTANCE: 5, FEROMONERATE: 0.2}
}
dictB = {INITIALPOINT: 'B', EDGE1: {INITIALPOINT: 'B', FINALPOINT: 'A', DISTANCE: 2, FEROMONERATE: 0.1},
EDGE2 : {INITIALPOINT: 'B', FINALPOINT: 'C', DISTANCE: 2, FEROMONERATE: 0.1},
EDGE3 : {INITIALPOINT: 'B', FINALPOINT: 'D', DISTANCE: 4, FEROMONERATE: 0.2},
EDGE4 : {INITIALPOINT: 'B', FINALPOINT: 'E', DISTANCE: 6, FEROMONERATE: 0.3}
}
dictC = {INITIALPOINT: 'C', EDGE1: {INITIALPOINT: 'C', FINALPOINT: 'A', DISTANCE: 5, FEROMONERATE: 0.1},
EDGE2 : {INITIALPOINT: 'C', FINALPOINT: 'B', DISTANCE: 2, FEROMONERATE: 0.1},
EDGE3 : {INITIALPOINT: 'C', FINALPOINT: 'D', DISTANCE: 5, FEROMONERATE: 0.5},
EDGE4 : {INITIALPOINT: 'C', FINALPOINT: 'E', DISTANCE: 5, FEROMONERATE: 0.1}
}
dictD = {INITIALPOINT: 'D', EDGE1: {INITIALPOINT: 'D', FINALPOINT: 'A', DISTANCE: 5, FEROMONERATE: 0.2},
EDGE2 : {INITIALPOINT: 'D', FINALPOINT: 'B', DISTANCE: 4, FEROMONERATE: 0.2},
EDGE3 : {INITIALPOINT: 'D', FINALPOINT: 'C', DISTANCE: 5, FEROMONERATE: 0.5},
EDGE4 : {INITIALPOINT: 'D', FINALPOINT: 'E', DISTANCE: 6, FEROMONERATE: 0.6}
}
dictE = {INITIALPOINT: 'E', EDGE1: {INITIALPOINT: 'E', FINALPOINT: 'A', DISTANCE: 3, FEROMONERATE: 0.2},
EDGE2 : {INITIALPOINT: 'E', FINALPOINT: 'B', DISTANCE: 6, FEROMONERATE: 0.3},
EDGE3 : {INITIALPOINT: 'E', FINALPOINT: 'C', DISTANCE: 5, FEROMONERATE: 0.1},
EDGE4 : {INITIALPOINT: 'E', FINALPOINT: 'D', DISTANCE: 6, FEROMONERATE: 0.6}
}
dictOfNodes = {
NODEA: dictA,
NODEB: dictB,
NODEC: dictC,
NODED: dictD,
NODEE: dictE,
}
def euclidean_jitter(a, b):
dist = distances.euclidean(a, b) # works for n-dimensions
return dist * random.random() * 2
def putAsciiValues(value, numberNodes):
'''
:param value: value of Node
:param numberNodes: nº de nós existente no grafo
:return: ascii correspondente, começando na letra A--> 1 é A, 2 é B, e por aí fora
'''
initialValue = 65 # ascii number of 'A'
return chr(initialValue+value)
def getConvertedEdges(graph : networkx.Graph):
convertedEdges = [[] * (graph.number_of_nodes()) for i in range(graph.number_of_nodes())] #--> Desta forma para evitar que as linhas sejam todas a msm referencia --> https://stackoverflow.com/questions/240178/list-of-lists-changes-reflected-across-sublists-unexpectedly
counter = 0
counter2 = 0
for i in range(len(graph.nodes)):
counter = 0
for u, v, data in graph.edges(data=True):
if u > i: #SE CHEGOU AO FIM DA LISTAGEM DAS EDGES
break
elif i == u:
if i == v:
itemArgs = {Utils.INITIALPOINT: putAsciiValues(u, graph.number_of_nodes()),
Utils.FINALPOINT: putAsciiValues(v, graph.number_of_nodes()),
Utils.DISTANCE: data['weight']}
convertedEdges[i].append(Edge.Edge(**itemArgs))
counter = counter + 1
if i != v:
itemArgs = {Utils.INITIALPOINT: putAsciiValues(u, graph.number_of_nodes()),
Utils.FINALPOINT: putAsciiValues(v, graph.number_of_nodes()),
Utils.DISTANCE: data['weight']}
convertedEdges[i].append(Edge.Edge(**itemArgs))
itemArgs = {Utils.INITIALPOINT: putAsciiValues(v, graph.number_of_nodes()),
Utils.FINALPOINT: putAsciiValues(u, graph.number_of_nodes()),
Utils.DISTANCE: data['weight']}
convertedEdges[v].append(Edge.Edge(**itemArgs))
else:
continue
return convertedEdges
def getConvertedNodes(graph : networkx.Graph):
convertedNodes = [0] * graph.number_of_nodes()
convertedEdges = getConvertedEdges(graph)
for i in range(graph.number_of_nodes()):
convertedNodes[i] = Node.Node(putAsciiValues(i, graph.number_of_nodes()), convertedEdges[i])
return convertedNodes
def convertNetworkxToGraphObject(graph : networkx.Graph):
'''
:param graph: Networkx Graph
:return: Graph Object converted from Networkx Graph
'''
try:
convertedNodes = getConvertedNodes(graph)
#CRIACAO DO GRAFO
convertedGraph = Graph.Graph(convertedNodes)
return convertedGraph
except:
raise