Possible gallery code.

The first example, three_by_three.py, is an example of the complete
bipartite graph of K3,3 minimally connected using a bezier curve to connect
the 3rd node.

The second example, ten_by_ten.py, is a graph of a minimally connected
K10,10 graph as conjectured by Zarankiewicz.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.python.org/pipermail/matplotlib-users/attachments/20151214/d4b9517f/attachment-0001.html>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: ten_by_ten.png
Type: image/png
Size: 131292 bytes
Desc: not available
URL: <http://mail.python.org/pipermail/matplotlib-users/attachments/20151214/d4b9517f/attachment-0002.png>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: ten_by_ten.py
Type: text/x-python
Size: 2251 bytes
Desc: not available
URL: <http://mail.python.org/pipermail/matplotlib-users/attachments/20151214/d4b9517f/attachment-0002.py>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: three_by_three.png
Type: image/png
Size: 35535 bytes
Desc: not available
URL: <http://mail.python.org/pipermail/matplotlib-users/attachments/20151214/d4b9517f/attachment-0003.png>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: three_by_three.py
Type: text/x-python
Size: 1429 bytes
Desc: not available
URL: <http://mail.python.org/pipermail/matplotlib-users/attachments/20151214/d4b9517f/attachment-0003.py>

The examples are nice, and there should be a place for them somewhere,
but I don't think we want to have any external dependencies like
networkx in the gallery. Does networkx have a gallery? If so, that
might be the proper home.

Eric

ยทยทยท

On 2015/12/14 10:09 AM, JP wrote:

The first example, three_by_three.py, is an example of the complete
bipartite graph of K3,3 minimally connected using a bezier curve to
connect the 3rd node.

The second example, ten_by_ten.py, is a graph of a minimally connected
K10,10 graph as conjectured by Zarankiewicz.