Hi. I've been reading the documentation and can't seem to find the an implementation that returns Set<List<Edge>> (or something similar) in order to find all of the paths from one vertex to another (as opposed to just the shortest path). I'm suprised if there isn't one already but if this is the case I'm happy to write something and submit it. Maybe everyone just see's this as too simpler task!

Thanks in advance,

James