@gduchaussois not sure I understand what you want... Djikstra gives you one (the shortest) path but you want all the paths (there can be an infinite number of paths if you don’t restrict your rules)?
@gduchaussois https://pypi.org/project/igraph/ supports graphviz format as import and can list you all the shortest paths (I assume it means "without cycle") between two dots, would that suit you?
@immae looks great, thanks a lot
@immae I never managed to make it read y dot file, but I converted to gml using gv2gml and piping through sed -e 's/\["/[/' -e 's/"\]/]/' I managed t import it with networkx and use all_simple_paths algorithm. Thanks a lot
@gduchaussois ah cool
@gduchaussois namely https://igraph.org/python/tutorial/latest/generation.html#from-file (import) and https://igraph.org/python/tutorial/latest/analysis.html#pathfinding-and-cuts (paths finding)