úÎ!ê     SafeX dijkstra-simple0Reachable vertices and associated lightest pathsdijkstra-simple[The lightest found path with reverse ordered list of traversed vertices and output weight.dijkstra-simplefConvert an input weight (edge-dependant) to an output weight (path-dependant) for the algorithm work. dijkstra-simpleAll vertices and outgoing edgesdijkstra-simple;Edge to an arbitrary vertex and the associated input weightdijkstra-simpleExplore all the reachable edgesdijkstra-simple(Find the eventual path between two edgesdijkstra-simple+Details each step of the Dijkstra algorithm   SafeXwdijkstra-simpleMThe classical weighter: the weight of a path is the sum of each edge weight.dijkstra-simple0Here we are looking for the heaviest edge weightSafeÅ !"#$%&'        !"#$%&,dijkstra-simple-0.1.0-6o0HbOFWw32KE2IAlEdD9TGraph.DijkstraSimpleGraph.DijkstraSimple.WeightersPaths_dijkstra_simplePaths pathsAsMapPath pathVertices pathWeightWeighter initialWeightweightGraph graphAsMapEdgeToedgeTo edgeToWeight lightestPathsfindPath dijkstraSteps $fEqEdgeTo $fShowEdgeTo $fEqGraph $fShowGraph$fEqPath $fShowPath $fEqPaths $fShowPathscumulativeWeightermaximumWeightWeighterversion getBinDir getLibDir getDynLibDir getDataDir getLibexecDir getSysconfDirgetDataFileName