delta/python-packages/networkx.git/networkx/classes/multidigraph.py, branch docdraft

"Warning" is not a numpydoc section

2015-06-13T20:22:22+00:00

pep8 for multidigraph

2015-03-26T19:02:15+00:00

Expand data keyword in G.edges and add default data

2015-01-18T02:42:00+00:00

When data=True, the whole data dictionary is returned for each edge.
When data=False, no data is returned.
Otherwise data is used as the attribute name of the edge data to return.
>>> [ (u,v,edata['weight']) for u,v,edata in G.edges(data=True) ]
becomes
>>> G.edges(data='weight')

>>> for n,nbrs in G.adjacency_iter():
...     for nbr,ddict in nbrs.items():
...         print (n,nbr,ddict.get('weight',1))
becomes
>>> G.edges(data='weight', default=1)

Meld special classes with base classes.

2015-01-02T05:18:11+00:00

This provides the ability to use OrderedGraph or ThinGraph by
simple subclassing of Graph.

Adjust graph/digraph/multigraph/multidgraph node attribute example so it doesn't depend on data ordering.

2012-06-23T17:52:02+00:00

Add comment about edges() v out_edges().

2012-04-08T19:34:41+00:00

Fixes #686

Change node lookups to G.node instead of G.adj

2012-02-06T04:32:34+00:00

This should help a small amount when playing with alternate
data structures.

Addreses:  #206, #583

Remove spurious iter() and iter(dict.keys()) calls due to 2to3.

2011-06-19T02:18:44+00:00

In this case all changes were either only used in a for loop,
or iter(dict.keys()).
Addresses #560

Remove weight is False or True backward compatibility in degree methods.

2011-06-19T00:43:05+00:00

Addresses #573

Change degree() and friends to accept weight= keyword instead of weighted=

2011-06-18T05:27:18+00:00

weight gives the edge attribute.  weighted was simply boolean.