delta/python-packages/networkx.git/networkx/generators/classic.py, branch docdraft github.com: networkx/networkx.git Fix copyrights 2015-04-21T16:51:07+00:00 JGab jean.gabriel.young@gmail.com 2015-04-21T16:51:07+00:00 bc987a9a5e3de487b231bfb27e4d0ee929d924c6 






Adds generator for complete multipartite graph.
2015-04-19T00:01:07+00:00

Jeffrey Finkelstein
jeffrey.finkelstein@gmail.com

2015-03-22T22:44:56+00:00

25028bf874bd0157a77c4d453f4d577cf2dd36d4












Fix docstest.
2015-04-14T05:04:43+00:00

chebee7i
chebee7i@gmail.com

2015-04-14T05:04:43+00:00

a3eca18b79719038e5b8e0a71bc36b268962c95e












Clean up docstring example.
2015-04-14T04:19:18+00:00

chebee7i
chebee7i@gmail.com

2015-04-14T04:19:18+00:00

8ed04af956dd7f0c068b88c15f483dc13ab57c7b












Update docstring to meet standards.
2015-04-14T00:44:03+00:00

Lucas Jones
ljnj@st-andrews.ac.uk

2015-04-14T00:44:03+00:00

dc44db101a36c9a234601802e9b99a86aef0f985












Fix style issues in circulant graph generator.
2015-03-30T17:48:04+00:00

Lucas Jones
ljnj@st-andrews.ac.uk

2015-03-30T17:48:04+00:00

24292a0b1e1abed8d2f3f967acd544f9c78b4d1b












Add generator function for circulant graphs.
2015-03-27T03:28:03+00:00

Lucas Jones
ljnj@st-andrews.ac.uk

2015-03-27T03:28:03+00:00

f5bc8a34cbb3156de36120cea9537e41df440927












fix complete_bipartite_graph import
2015-03-05T15:21:31+00:00

SanketDG
sanketdasgupta@gmail.com

2015-03-05T15:21:31+00:00

1c022dd1fb9e5555191c82d8f2132eb1164511b9












Refactor complete_bipartite_graph. Fixes #1375.
2015-03-02T20:36:03+00:00

Jordi Torrents
jordi.t21@gmail.com

2015-03-02T20:36:03+00:00

3b241e97718fb782fd1b35ae42b372f61ba59f7c

This commit reimplements `complete_bipartite_graph` using a generator
expression instead of two nested for loops. Also adds the `bipartite`
node attribute (that was missing, as per #1375).

I've also moved the `complete_bipartite_graph` function from `classic.py`
to `bipartite.py`. I think it's better to have all bipartite generators
together.

The function `complete_bipartite_graph` is used by other functions, such as
`wheel_graph`, which was abusing the interface by passing -1 as the second
argument of `complete_bipartite_graph` (for `wheel_graph(0)`) and hoping to
get an empty graph with zero nodes. This is also fixed.





This commit reimplements `complete_bipartite_graph` using a generator
expression instead of two nested for loops. Also adds the `bipartite`
node attribute (that was missing, as per #1375).

I've also moved the `complete_bipartite_graph` function from `classic.py`
to `bipartite.py`. I think it's better to have all bipartite generators
together.

The function `complete_bipartite_graph` is used by other functions, such as
`wheel_graph`, which was abusing the interface by passing -1 as the second
argument of `complete_bipartite_graph` (for `wheel_graph(0)`) and hoping to
get an empty graph with zero nodes. This is also fixed.







Adds a generator for the chordal p-cycle graph.
2014-12-16T00:04:59+00:00

Jeffrey Finkelstein
jeffrey.finkelstein@gmail.com

2014-12-16T00:04:59+00:00

541fd32fdc339bd157af34be60abd1a500eca961

Adds the chordal p-cycle graph, a mildly explicit algebraic construction
of a family of 3-regular expander graphs. Also, moves both the existing
expander graph generator function (for the Margulis-Gabber-Galil
expander) and the new chordal cycle graph function to a new module,
networkx.generators.expanders.





Adds the chordal p-cycle graph, a mildly explicit algebraic construction
of a family of 3-regular expander graphs. Also, moves both the existing
expander graph generator function (for the Margulis-Gabber-Galil
expander) and the new chordal cycle graph function to a new module,
networkx.generators.expanders.