`If I'm understanding your question correctly, when you load the vertex,`

`you'll want to read all the lines of the same vertex id and then`

`construct the vertex with the edges. The edges of the vertex need not`

`be sorted. But the lines of the same vertex id will have to be grouped`

`together so that you can process one vertex at a time. This is the case`

`until something like GIRAPH-155 is completed.`

Avery

## Advertising

On 3/15/12 4:14 PM, Fleischman, Stephen (ISS SCI - Plano TX) wrote:

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