P.-S.
Attention spoiler, j’ai passé le programme ldvelh_graphviz sur les deux premiers volumes de la gamme de livre jeux « Choose Cthulhu » !
$ ./ldvelh-graphviz.py --graph choose_cthulhu-01-l_appel_de_cthulhu --first
find_first_path:
[1, 32, 69, 36, 34, 44, 100, 88, 60, 42, 51, 86, 67, 78, 6, 92, 76, 87, 91, 20, 18, 41, 3, 90, 37, 63, 48, 94, 85, 7, 31, 75, 84, 26, 4, 111] (36)
0.00040272400110552553 s
$ ./ldvelh-graphviz.py --graph choose_cthulhu-01-l_appel_de_cthulhu --dijkstra
find_shortest_Dijkstra_path:
[1, 56, 9, 18, 41, 3, 90, 37, 85, 7, 84, 26, 4, 111] (14)
0.0006176570004754467 s
$ ./ldvelh-graphviz.py --graph choose_cthulhu-02-les_montagnes_hallucinees --first
find_first_path:
[1, 57, 13, 19, 74, 51, 41, 78, 61, 72, 107, 104, 3, 20, 23, 52, 85, 6, 22, 35, 50, 95, 93, 31, 39, 84, 73, 86, 69, 66, 14, 103, 90, 34, 8, 15, 24, 45, 9, 49, 68, 10, 87, 47, 111] (45)
0.00041911799962690566 s
$ ./ldvelh-graphviz.py --graph choose_cthulhu-02-les_montagnes_hallucinees --dijkstra
find_shortest_Dijkstra_path:
[1, 92, 41, 78, 61, 72, 107, 104, 3, 20, 23, 52, 85, 6, 22, 35, 50, 95, 93, 100, 30, 83, 90, 34, 45, 9, 49, 68, 10, 87, 47, 111] (32)
0.0006076810004742583 s