P.-S.
J’ai rajouté (2023) une catégorie LDVELH avec les 5 volumes d’Épée de Légende se déroulant dans le même univers (jouable en ligne ;)
Attention spoiler, j’ai passé le programme ldvelh_graphviz sur les cinq volumes de la gamme !
$ ./ldvelh-graphviz.py --graph edl-1-les_treize_mages --dijkstra
find_shortest_Dijkstra_path:
[1, 452, 52, 471, 328, 349, 233, 177, 402, 135, 140, 286, 10, 5, 356, 318, 112, 142, 252, 128, 88, 98, 298, 129, 253, 319, 392, 269, 359, 341, 377, 68, 238, 271, 468, 272, 159, 538, 394, 322, 361, 540] (42)
0.0031568349986628164 s
$ ./ldvelh-graphviz.py --graph edl-2-le_maitre_des_reves --dijkstra
find_shortest_Dijkstra_path:
[1, 259, 126, 486, 24, 119, 73, 85, 335, 159, 142, 268, 254, 539, 165, 267, 364, 232, 417, 250, 29, 424, 16, 536, 378, 402, 117, 534, 81, 520, 425, 289, 501, 233, 447, 61, 66, 104, 168, 432, 313, 196, 249, 275, 318, 35, 428, 543, 270, 371, 547, 353, 380, 34, 145, 508, 25, 178, 21, 359, 300, 15, 282, 460, 62, 570] (66)
0.003385168998647714 s
$./ldvelh-graphviz.py --graph edl-3-le_port_des_assassins --dijkstra
find_shortest_Dijkstra_path:
[1, 269, 165, 345, 170, 251, 406, 503, 150, 195, 329, 391, 310, 56, 290, 44, 501, 39, 183, 474, 467, 253, 367, 19, 343, 316, 284, 176, 567, 463, 494, 166, 461, 356, 214, 40, 415, 304, 144, 388, 489, 31, 588] (43)
0.003586188002373092 s
$ ./ldvelh-graphviz.py --graph edl-4-l_impossible_mission --dijkstra
find_shortest_Dijkstra_path:
[1, 127, 193, 152, 179, 115, 388, 104, 173, 418, 462, 380, 109, 220, 456, 392, 71, 156, 316, 546, 471, 408, 536, 310, 250, 551, 428, 256, 73, 544, 87, 105, 69, 358, 342, 83, 489, 21, 515, 341, 530, 333, 521, 4, 556, 517, 491, 527, 262, 150, 169, 325, 186, 121, 52, 28, 493, 43, 399, 438, 92, 557] (62)
0.003377385997737292 s
$ ./ldvelh-graphviz.py --graph edl-5-les_murailles_de_spyte --dijkstra --start 0 --end 62
find_shortest_Dijkstra_path:
[0, 1, 505, 382, 274, 448, 417, 248, 469, 349, 376, 403, 229, 58, 485, 447, 535, 486, 222, 112, 483, 167, 509, 450, 360, 263, 264, 292, 372, 341, 62] (31)
0.0029207220004536794 s
$ ./ldvelh-graphviz.py --graph edl-5-les_murailles_de_spyte --dijkstra --start 62 --end 252
find_shortest_Dijkstra_path:
[62, 194, 257, 119, 99, 473, 38, 432, 525, 252] (10)
0.002316473000064434 s
$ ./ldvelh-graphviz.py --graph edl-5-les_murailles_de_spyte --dijkstra --start 252 --end 322
find_shortest_Dijkstra_path:
[252, 119, 330, 79, 410, 322] (6)
0.00216581499989843 s
$ ./ldvelh-graphviz.py --graph edl-5-les_murailles_de_spyte --dijkstra --start 322 --end 335
find_shortest_Dijkstra_path:
[322, 258, 291, 119, 203, 51, 373, 315, 335] (9)
0.002196839000134787 s
$ ./ldvelh-graphviz.py --graph edl-5-les_murailles_de_spyte --dijkstra --start 335 --end 401
find_shortest_Dijkstra_path:
[335, 93, 80, 119, 99, 473, 38, 432, 124, 294, 401] (11)
0.002313048999894818 s
$ ./ldvelh-graphviz.py --graph edl-5-les_murailles_de_spyte --dijkstra --start 401 --end 423
find_shortest_Dijkstra_path:
[401, 119, 354, 266, 398, 463, 100, 206, 16, 423] (10)
0.0025518120000924682 s
$ ./ldvelh-graphviz.py --graph edl-5-les_murailles_de_spyte --dijkstra --start 423 --end 550
find_shortest_Dijkstra_path:
[423, 119, 541, 316, 540, 152, 409, 29, 188, 456, 548, 542, 183, 303, 165, 282, 144, 90, 130, 113, 26, 343, 49, 517, 34, 196, 96, 190, 44, 550] (30)
0.002613564000057522 s