We can't sort the nodes since they may not be orderable (only required
to be hashable).
We did recently implement an OrderedGraph class so if you get the
latest development version of NetworkX you can replace
Graph()->OrderedGraph() and the output order will be determined by the
order the nodes and edges are added to the graph.
If I remember right some of the graphviz algorithms use random initial
placement of nodes (might be controllable) so this might not
completely solve your problem.
Aric
> --
> You received this message because you are subscribed to the Google Groups
> "networkx-discuss" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to
networkx-discu...@googlegroups.com.
> To post to this group, send email to
networkx...@googlegroups.com.
> Visit this group at
http://groups.google.com/group/networkx-discuss.
> For more options, visit
https://groups.google.com/d/optout.