Hi, I would like to find all the shortest path between two nodes in a Digraph. I am wondering what could be the most simple way to achieve that? As I know Dijkstra can be modified to be able to provide all the paths, but have not found any LEMON specific examples or mailings regarding this topic. Thanks, Mate