I'm working with the shortest path example and using datasets consisting of two columns - a "from" vertex and a "to" vertex, so that a vertex with n edges is repeated n times. In constructing the sorted adjacency list does each adjacent vertex array also have to be sorted?
Thank you, Steve Fleischman
