<feed xmlns='http://www.w3.org/2005/Atom'>
<title>delta/python-packages/networkx.git/networkx/algorithms/swap.py, branch docdraft</title>
<subtitle>github.com: networkx/networkx.git
</subtitle>
<link rel='alternate' type='text/html' href='http://git.baserock.org/cgit/delta/python-packages/networkx.git/'/>
<entry>
<title>Optimization for connected double edge swap.</title>
<updated>2015-04-27T20:25:04+00:00</updated>
<author>
<name>Jeffrey Finkelstein</name>
<email>jeffrey.finkelstein@gmail.com</email>
</author>
<published>2015-04-23T03:04:05+00:00</published>
<link rel='alternate' type='text/html' href='http://git.baserock.org/cgit/delta/python-packages/networkx.git/commit/?id=5c68570a58d623d8b8134621766909a5f3cf7086'/>
<id>5c68570a58d623d8b8134621766909a5f3cf7086</id>
<content type='text'>
This implements an optimization that speeds up the
`connected_double_edge_swap()` function. It uses a threshold, below
which graph connectivity is checked after each swap, and above which,
graph connectivity is only checked after a number of swaps are made.
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
This implements an optimization that speeds up the
`connected_double_edge_swap()` function. It uses a threshold, below
which graph connectivity is checked after each swap, and above which,
graph connectivity is only checked after a number of swaps are made.
</pre>
</div>
</content>
</entry>
<entry>
<title>Fix copyrights</title>
<updated>2015-04-21T16:51:07+00:00</updated>
<author>
<name>JGab</name>
<email>jean.gabriel.young@gmail.com</email>
</author>
<published>2015-04-21T16:51:07+00:00</published>
<link rel='alternate' type='text/html' href='http://git.baserock.org/cgit/delta/python-packages/networkx.git/commit/?id=bc987a9a5e3de487b231bfb27e4d0ee929d924c6'/>
<id>bc987a9a5e3de487b231bfb27e4d0ee929d924c6</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>lean extra white space and update copywrite in swap.py</title>
<updated>2012-03-28T17:46:46+00:00</updated>
<author>
<name>Dan Schult</name>
<email>dschult@colgate.edu</email>
</author>
<published>2012-03-28T17:46:46+00:00</published>
<link rel='alternate' type='text/html' href='http://git.baserock.org/cgit/delta/python-packages/networkx.git/commit/?id=ee8314a52840959fb8df8d9b8348c1af4dcce456'/>
<id>ee8314a52840959fb8df8d9b8348c1af4dcce456</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>Update tests and documentation.</title>
<updated>2011-12-10T15:12:33+00:00</updated>
<author>
<name>Aric Hagberg</name>
<email>aric.hagberg@gmail.com</email>
</author>
<published>2011-12-10T15:12:33+00:00</published>
<link rel='alternate' type='text/html' href='http://git.baserock.org/cgit/delta/python-packages/networkx.git/commit/?id=d48915203e2682786f6081ce0a1e3979541b4c05'/>
<id>d48915203e2682786f6081ce0a1e3979541b4c05</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
<entry>
<title>Refactor large degree_seq.py into pieces and put non-generator pieces in algorithms and utils.</title>
<updated>2011-11-03T19:47:48+00:00</updated>
<author>
<name>Aric Hagberg</name>
<email>aric.hagberg@gmail.com</email>
</author>
<published>2011-11-03T19:47:48+00:00</published>
<link rel='alternate' type='text/html' href='http://git.baserock.org/cgit/delta/python-packages/networkx.git/commit/?id=36b76facc4c3abec437ab46cba0a243d48b9f9c4'/>
<id>36b76facc4c3abec437ab46cba0a243d48b9f9c4</id>
<content type='text'>
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
</pre>
</div>
</content>
</entry>
</feed>
