`Sorry about the old documentation. I just updated the shortest paths`

`example. Before major changes to the graph distribution, the vertex ids`

`were required to be sorted. That is no longer the case. You can input`

`vertices in any order. The only restriction is that the vertex ids must`

`be unique (no duplicate vertices). If there are duplicates an exception`

`will be thrown since duplicates are probably not expected and this is`

`probably an error. This could be relaxed in the future as well if need`

`be, but we would need to decide on how to handle duplicates.`

Thanks for all the great questions!

## Advertising

Avery On 2/19/12 11:25 AM, yavuz gokirmak wrote:

Hi,In Shortest Paths Example it is written that "Currently there is onerestriction on the VertexInputFormat that is not obvious. The verticesmust be sorted.". I didn't understand the reason of this restriction,why vertices should be ordered?Secondly, as I understood, we have to transform our initial data intoa form that each line corresponds to a vertex(with edge and values ifexists) in the graph.For example, I have a data that each row is corresponds to an edgebetween to verticesformat1: a b a c a d b c b a c dDo I have to convert this file into a format similar to below in orderto use with giraph algorithms?format2: a b c d b c a c d thanks..