I have a graph loaded as an edgelist (el) and a sequence of vertices (verts) loaded. I can get the ShortestPathss to run using "val sp = ShortestPaths.run(el,verts)" and I can get the length of the shortest path out of there (say 6, meaning 6 edges between the verts). I'd like to know what those edges are.
My question is there any way to list the edges along the shortest path? and not just the length of the path?