-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCode.py
157 lines (127 loc) · 4.57 KB
/
Code.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
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
# Dijkstra's Algorithm in Python
import sys
# Providing the graph
vertices = [[0, 0, 1, 1, 0, 0, 0],
[0, 0, 1, 0, 0, 1, 0],
[1, 1, 0, 1, 1, 0, 0],
[1, 0, 1, 0, 0, 0, 1],
[0, 0, 1, 0, 0, 1, 0],
[0, 1, 0, 0, 1, 0, 1],
[0, 0, 0, 1, 0, 1, 0]]
edges = [[0, 0, 1, 2, 0, 0, 0],
[0, 0, 2, 0, 0, 3, 0],
[1, 2, 0, 1, 3, 0, 0],
[2, 0, 1, 0, 0, 0, 1],
[0, 0, 3, 0, 0, 2, 0],
[0, 3, 0, 0, 2, 0, 1],
[0, 0, 0, 1, 0, 1, 0]]
# Find which vertex is to be visited next
def to_be_visited():
global visited_and_distance
v = -10
for index in range(num_of_vertices):
if visited_and_distance[index][0] == 0 \
and (v < 0 or visited_and_distance[index][1] <=
visited_and_distance[v][1]):
v = index
return v
num_of_vertices = len(vertices[0])
visited_and_distance = [[0, 0]]
for i in range(num_of_vertices-1):
visited_and_distance.append([0, sys.maxsize])
for vertex in range(num_of_vertices):
# Find next vertex to be visited
to_visit = to_be_visited()
for neighbor_index in range(num_of_vertices):
# Updating new distances
if vertices[to_visit][neighbor_index] == 1 and \
visited_and_distance[neighbor_index][0] == 0:
new_distance = visited_and_distance[to_visit][1] \
+ edges[to_visit][neighbor_index]
if visited_and_distance[neighbor_index][1] > new_distance:
visited_and_distance[neighbor_index][1] = new_distance
visited_and_distance[to_visit][0] = 1
i = 0
# Printing the distance
for distance in visited_and_distance:
print("Distance of ", chr(ord('a') + i),
" from source vertex: ", distance[1])
i = i + 1
from collections import defaultdict
class Grafo():
def __init__(self):
self.arestas = defaultdict(list)
self.pesos = {}
def adiciona_aresta(self, no_inicio, no_final, peso):
self.arestas[no_inicio].append(no_final)
self.arestas[no_final].append(no_inicio)
self.pesos[(no_inicio, no_final)] = peso
self.pesos[(no_final, no_inicio)] = peso
def Dijsktra(grafo, inicial, final):
caminho_curto = {inicial: (None, 0)}
no_atual = inicial
visitado = set()
while no_atual != final:
visitado.add(no_atual)
destinos = grafo.arestas[no_atual]
peso_nodo_atual = caminho_curto[no_atual][1]
for proximo_no in destinos:
peso = grafo.pesos[(no_atual, proximo_no)] + peso_nodo_atual
if proximo_no not in caminho_curto:
caminho_curto[proximo_no] = (no_atual, peso)
else:
current_shortest_weight = caminho_curto[proximo_no][1]
if current_shortest_weight > peso:
caminho_curto[proximo_no] = (no_atual, peso)
proximos_destinos = {vertice: caminho_curto[vertice] for vertice in caminho_curto if vertice not in visitado}
if not proximos_destinos:
return "Rota impossível"
no_atual = min(proximos_destinos, key=lambda k: proximos_destinos[k][1])
caminho = []
while no_atual is not None:
caminho.append(no_atual)
proximo_no = caminho_curto[no_atual][0]
no_atual = proximo_no
caminho = caminho[::-1]
return caminho
grafo = Grafo()
arestas = [
('V1', 'V2', 5),
('V1', 'V4', 5),
('V1', 'V5', 9),
('V2', 'V3', 4),
('V2', 'V6', 2),
('V2', 'V5', 9),
('V2', 'V4', 4),
('V3', 'V6', 2),
('V4', 'V5', 3),
('V4', 'V7', 5),
('V4', 'V8', 6),
('V5', 'V7', 9),
('V5', 'V8', 4),
('V6', 'V8', 7),
('V6', 'V9', 1),
('V7', 'V8', 6),
('V7', 'V10', 10),
('V8', 'V9', 2),
('V8', 'V10', 3)
]
for aresta in arestas:
grafo.adiciona_aresta(*aresta)
combinacoes=[
['V1', 'V2'],['V1', 'V3'],['V1', 'V4'],['V1', 'V5'],['V1', 'V6'],['V1', 'V7'],['V1', 'V8'],['V1', 'V9'],['V1', 'V10'],
['V2', 'V3'],['V2', 'V4'],['V2', 'V5'],['V2', 'V6'],['V2', 'V7'],['V2', 'V8'],['V2', 'V9'],['V2', 'V10'],
['V3', 'V4'],['V3', 'V5'],['V3', 'V6'],['V3', 'V7'],['V3', 'V8'],['V3', 'V9'],['V3', 'V10'],
['V4', 'V5'],['V4', 'V6'],['V4', 'V7'],['V4', 'V8'],['V4', 'V9'],['V4', 'V10'],
['V5', 'V6'],['V5', 'V7'],['V5', 'V8'],['V5', 'V9'],['V5', 'V10'],
['V6', 'V7'],['V6', 'V8'],['V6', 'V9'],['V6', 'V10'],
['V7', 'V8'],['V7', 'V9'],['V7', 'V10'],
['V8', 'V9'],['V8', 'V10'],
['V9', 'V10']
]
todos_caminhos = []
for i in range(len(combinacoes)):
caminho = Dijsktra(grafo, combinacoes[i][0],combinacoes[i][1])
todos_caminhos.append(caminho)
print("Caminho de "+combinacoes[i][0]+" para "+combinacoes[i][1]+" : ")
print(caminho)