Sorted adjacency lists are needed for numerous applications: triangle counting, K-Truss.
Sorting can also be useful for updating a graph as it is easier to lookup values.

Each of the adjacency arrays needs to be sorted.