2014-04-18 17:01 GMT+02:00 ysitu <notifications@github.com>:

> In networkx/algorithms/flow/capacity_scaling.py:
>
> > +    >>> G.add_node('a', demand = -5)
> > +    >>> G.add_node('d', demand = 5)
> > +    >>> G.add_edge('a', 'b', weight = 3, capacity = 4)
> > +    >>> G.add_edge('a', 'c', weight = 6, capacity = 10)
> > +    >>> G.add_edge('b', 'd', weight = 1, capacity = 9)
> > +    >>> G.add_edge('c', 'd', weight = 2, capacity = 5)
> > +    >>> flowCost, flowDict = nx.capacity_scaling(G)
> > +    >>> flowCost
> > +    24
> > +    >>> flowDict # doctest: +SKIP
> > +    {'a': {'c': 1, 'b': 4}, 'c': {'d': 1}, 'b': {'d': 4}, 'd': {}}
> > +
> > +    The mincost flow algorithm can also be used to solve shortest path
> > +    problems. To find the shortest path between two nodes u and v,
> > +    give all edges an infinite capacity, give node u a demand of -1 and
> > +    node v a demand a 1. Then run the network simplex. The value of a
>
> This is great for textbook material but just plain weird for software
> documentation. I have removed it outright in the next commit.
>
Ok, sounds good.