summaryrefslogtreecommitdiff
path: root/networkx/algorithms/approximation
Commit message (Expand)AuthorAgeFilesLines
* Fix latexAric Hagberg2015-06-131-4/+4
* Merge pull request #1566 from jfinkels/approximate-minimum-domsetchebee7i2015-06-082-59/+93
|\
| * Fixes approximate dominating set greedy choice.Jeffrey Finkelstein2015-06-072-59/+93
* | Removed test that failed depending on the iteration order.Jordi Torrents2015-06-031-4/+6
* | Remove the exact parameter from approximation.k_components.Jordi Torrents2015-06-032-86/+13
* | Improve AntiGraph.Jordi Torrents2015-06-031-4/+3
* | Fix import in docstring example.Jordi Torrents2015-06-031-1/+1
* | Add fast approximation for k-(node)-components.Jordi Torrents2015-06-033-0/+694
|/
* Use a positional argument for the container of nodes to exclude.Jordi Torrents2015-03-151-8/+5
* Clarify cutoff parameter in the docstrings.Jordi Torrents2015-03-151-3/+6
* Add fast approximation for node connectivity.Jordi Torrents2015-03-143-0/+564
* Generate random node indices instead of calling random.choice.Jordi Torrents2013-08-261-4/+5
* Added proper tests.Jordi Torrents2013-08-151-65/+32
* Improved code and added docstrings.Jordi Torrents2013-08-151-38/+33
* Added some tests. Updated style to match PEP-8.Fred Morstatter2013-05-132-10/+79
* Fixed init to include my new function.Fred Morstatter2013-05-091-0/+1
* FGM - Added code for approximating the clustering coefficientFred Morstatter2013-05-091-0/+61
* Fix errors in docs.Aric Hagberg2013-01-043-9/+9
* another doc string updatedNicholas Mancuso2012-10-061-5/+11
* update doc strings for approximation moduleNicholas Mancuso2012-10-065-39/+61
* update docstringsAric Hagberg2012-05-072-2/+4
* add docstringAric Hagberg2012-05-061-2/+4
* Fix latex symbols.Aric Hagberg2012-05-061-5/+5
* Fix some syntax to work with Python2.6Aric Hagberg2012-05-062-5/+5
* Add independent set.Aric Hagberg2012-04-153-0/+72
* Add max clique test.Aric Hagberg2012-04-151-1/+8
* Add max clique.Aric Hagberg2012-04-152-2/+55
* Add matching.Aric Hagberg2012-04-153-0/+47
* Add dominating set problem.Aric Hagberg2012-04-153-0/+150
* Add clique and ramsey.Aric Hagberg2012-04-155-0/+144
* Add vertex cover approximation algorithm.Aric Hagberg2012-04-153-0/+99