In the current version 22.11.1, the edge list is a linked list where the order of insertion is not maintained. It's neither ascending nor descending, but close to random (Technically the edges are appended in a chunk, so ordered in the chunk, but when the chunk is full, a new chunk is created as the first chunk, so the order is messed up from the moment the 2nd chunk is created).
It's a very common use case retrieving the edges in ascending or descending order of the insertion. Creating ascending order is quite expensive with the current implementation while modifying the current code to support the descending order is trivial.
The API will be unchanged. If the user wants the edges in ascending order, he must browse all the edges and put them in a list to be iterated in reverse order.
In the current version 22.11.1, the edge list is a linked list where the order of insertion is not maintained. It's neither ascending nor descending, but close to random (Technically the edges are appended in a chunk, so ordered in the chunk, but when the chunk is full, a new chunk is created as the first chunk, so the order is messed up from the moment the 2nd chunk is created).
It's a very common use case retrieving the edges in ascending or descending order of the insertion. Creating ascending order is quite expensive with the current implementation while modifying the current code to support the descending order is trivial.
The API will be unchanged. If the user wants the edges in ascending order, he must browse all the edges and put them in a list to be iterated in reverse order.