In Graph it's documented for ->vertices that "In list context, return the vertices, in no particular order."

sort is very efficient and it sounds strange that your algorithm depends on the order of vertices.

I'd say this sounds like a XY Problem , and you should elaborate more what you are trying to achieve.