Reordering Adjacency Lists

[Adrian Neumann]

Hi,

is there a way to order the adjacency list of a graph such that for
example a DFS visits nodes with a higher label first? It appears that
the adjacency list is stored as an unordered dictionary.

Greets,

Adrian

[Aric Hagberg]

The adjacency structure is based on Python dictionaries so there is no
ordering of the nodes by default. You could modify the depth first
algorithms to order the nodes during traversal.
Here is an example of how to do that to visit the nodes in sorted
order (nodes must be sortable).
https://gist.github.com/3751844
Aric