WiKi informatique - jour_tp_chemin
https://wiki.centrale-med.fr/informatique/
2026-05-21T03:54:43+00:00
WiKi informatique
https://wiki.centrale-med.fr/informatique/
https://wiki.centrale-med.fr/informatique/entrale-med.fr/informatique/lib/tpl/bootstrap3/images/favicon.ico
-
text/html
2018-11-16T13:43:01+00:00
Anonymous (anonymous@undisclosed.example.com)
dijjstra
https://wiki.centrale-med.fr/informatique/jour_tp_chemin:dijjstra?rev=1542375781&do=diff
import math
INFINI = math.inf
NEIGHBOURS = "neighbours"
def dijkstra(graph, origin, destination=None):
distances = {}
ancestors = {}
unknown = {}
path = []
finish = False
for city in graph:
unknown[city] = True
ancestors[city] = origin
if city in graph[origin][NEIGHBOURS]:
distances[city] = graph[origin][NEIGHBOURS][city]
else:
distances[city] = INFINI
distances[origin] = 0
unknown[origin] = False
new_c…
-
text/html
2018-12-04T11:00:34+00:00
Anonymous (anonymous@undisclosed.example.com)
roy
https://wiki.centrale-med.fr/informatique/jour_tp_chemin:roy?rev=1543921234&do=diff
import math
INFINI = math.inf
NEIGHBOURS = "neighbours"
def roy-floyd-warshall(graph):
distances = {}
steps = {}
for origin in graph:
steps[origin] = {}
distances[origin] = {}
for destination in graph:
steps[origin][destination] = None
distances[origin][destination] = INFINI
if destination in graph[origin][NEIGHBOURS]:
distances[origin][destination] = graph[origin][NEIGHBOURS][destination]
distances…