The NetworkX documentation isn't very helpful there.
Load and betweenness are slightly different algorithms
but in some cases produce the same results.
This is a good reference that explains the difference:
Ulrik Brandes: On Variants of Shortest-Path Betweenness Centrality and
their Generic Computation.
Social Networks 30(2):136-145, 2008.
http://www.informatik.uni-konstanz.de/algo/publications/b-vspbc-08.pdf
Aric