summaryrefslogtreecommitdiff
path: root/doc
Commit message (Collapse)AuthorAgeFilesLines
* Get directories correct.docdraftchebee7i2015-06-141-2/+25
|
* Remove shebang.chebee7i2015-06-143-19/+2
|
* Attempt matplotlib import.chebee7i2015-06-141-0/+2
|
* os.listdirchebee7i2015-06-141-3/+3
|
* Syntax errorchebee7i2015-06-141-2/+2
|
* Print sys.paths.chebee7i2015-06-141-1/+11
|
* Debug RTD build.chebee7i2015-06-141-0/+9
|
* Try using proper python.chebee7i2015-06-141-2/+2
|
* Conditionally build gallery and examples when on rtd.chebee7i2015-06-141-0/+7
|
* Configure documentation for readthedocs.orgchebee7i2015-06-142-16/+37
|
* Update link to historical contributions.chebee7i2015-06-131-1/+1
|
* Merge pull request #1597 from hagberg/doc-fixeschebee7i2015-06-138-122/+20
|\ | | | | Doc fixes
| * Missing spaceAric Hagberg2015-06-131-1/+1
| |
| * Typos and formatting errorsAric Hagberg2015-06-133-15/+15
| |
| * Remove old creditsAric Hagberg2015-06-131-92/+0
| |
| * Add missing reference to triadsAric Hagberg2015-06-131-0/+1
| |
| * Underline too shortAric Hagberg2015-06-131-1/+1
| |
| * Over/underline length adjustmentAric Hagberg2015-06-131-2/+2
| |
| * Remove doc reference to generators.hybrid (in algorithms now).Aric Hagberg2015-06-131-11/+0
| |
* | Merge pull request #1570 from chebee7i/drawing_docchebee7i2015-06-131-0/+18
|\ \ | |/ |/| Add some comments/recommendations about drawing.
| * Add some comments/recommendations about drawing.chebee7i2015-06-101-0/+18
| |
* | make identified_nodes an alias for contracted_nodesSanketDG2015-06-051-0/+1
|/
* Added k_components approximation to API changes.Jordi Torrents2015-06-031-0/+6
|
* Add k_components and other approx connectivity funcs to the docs.Jordi Torrents2015-06-031-0/+20
|
* Add k-(node)-components algorithm.Jordi Torrents2015-06-032-1/+13
| | | | | | | | | | | | | | | | | | | | | | | | | | Add Moody and White algorithm for for identifying k-components in a graph, which is based on Kanevsky's algorithm for finding all minimum-size node cut-sets (implemented in `all_node_cuts` function #1391). This algorithm consists in keep cutting a graph until we obtain either a complete or a trivial graph. `all_node_cuts` is doing most of the work here, the only tricky implementation thing is the generation of partitions. The authors say that ``Nodes in a cutset belong to both sides of the induced cut.'', but an induced cut can split a graph in more than two sides. Thus, after a cut, we have to merge the node sets that (after adding the nodes in the cut set) share at least k nodes. I found out that this is very related to set consolidation, which is implemented using connected components. This implementation is slower than the iterative version from rosettacode.org because of the overhead of building a graph and calling nx.connected_components, but we perform the same number of intersection operations. Also, it's possible that subsets of an already detected k-component appear at a level k. Checking for this in the main while loop penalizes the common case. Thus we also have to _consolidate all connectivity levels in _reconstruct_k_components.
* Update api_1.10.rstMridul Seth2015-05-271-18/+18
|
* Update api_2.0.rst to api_1.10.rst and deprecate *iter functionsMridul Seth2015-05-252-3/+8
|
* Fix paren typo in tutorialAric Hagberg2015-05-121-1/+1
|
* Merge pull request #1501 from jtorrents/refactor-connected-componentsAric Hagberg2015-05-101-0/+10
|\ | | | | Refactor connected components
| * Update API changes, all components functions yield sets now.Jordi Torrents2015-05-071-3/+5
| |
| * Refactor and improve the documentation for connected_components.Jordi Torrents2015-05-071-0/+8
| | | | | | | | | | | | | | | | | | | | | | | | | | | | Make connected_components a generator of sets of nodes, it was a generator of list of nodes. See #1501 for discussion. Use a plain BFS to compute them instead of using the single source shortest path function. The latter also does a BFS but keeps track of the distances. This is only slightly faster for small graphs (arround 5% in my tests), but for larger graphs the speed up is more relevant (around 1.8x faster). Also I think it's conceptually better. As @ysitu said, we have a tendency to abuse shortest paths functions for reachability. Also improved biconnected components examples, docstrings, and code.
* | Cleans documentation for generators.random_graphsJeffrey Finkelstein2015-05-081-0/+1
| |
* | Merge pull request #1421 from jtorrents/all-cuts-wrap-upJordi Torrents2015-05-071-1/+8
|\ \ | |/ |/| all_node_cuts wrap up
| * Add all_node_cuts to api_2.0.rst. Also add credit for antichains.Jordi Torrents2015-04-271-1/+8
| |
* | Merge pull request #1481 from Overriders/johnsonchebee7i2015-05-052-0/+6
|\ \ | | | | | | Adds Johnson's algorithm for computing all pairs shortest paths
| * | Solve merge conflictsThodoris Sotiropoulos2015-05-051-5/+5
| | |
| * | Implement Johnson's algorithm for shortest pathsThodoris Sotiropoulos2015-05-052-0/+6
| | | | | | | | | | | | | | | Compute shortest paths between all nodes in a weighted graph using Johnson's algorithm
* | | Exposes documentation for algorithms.hybrid.Jeffrey Finkelstein2015-05-052-0/+11
| | | | | | | | | | | | | | | Previously, though it existed, this module's documentation was not exposed as part of the public documentation.
* | | Merge pull request #1399 from MridulS/powfuncchebee7i2015-05-042-4/+4
|\ \ \ | | | | | | | | Added power function for simple graphs
| * | | Update api_2.0.rst and algorithms.operators.rstMridul Seth2015-04-102-4/+4
| | | |
* | | | Merge pull request #1494 from jfinkels/biadjacency-docAric Hagberg2015-05-021-1/+10
|\ \ \ \ | | | | | | | | | | Fixes biadjacency matrix documentation
| * | | | Fixes biadjacency matrix documentationJeffrey Finkelstein2015-05-021-1/+10
| | |/ / | |/| |
* | | | Removes reference to nonexistent functionjfinkels2015-05-021-1/+0
|/ / /
* | | Merge remote-tracking branch 'rnelsonchem/dffix'chebee7i2015-04-302-0/+8
|\ \ \ | | | | | | | | | | | | | | | | | | | | Conflicts: doc/source/reference/api_2.0.rst doc/source/reference/credits.rst
| * | | Updated api and credit docs for new additionRyan Nelson2015-04-302-0/+9
| | | |
* | | | Merge branch 'master' of github.com:networkx/networkxchebee7i2015-04-292-0/+6
|\ \ \ \ | | | | | | | | | | | | | | | | | | | | Conflicts: doc/source/reference/api_2.0.rst
| * | | | Adds vertex and edge contraction functions.Jeffrey Finkelstein2015-04-292-0/+6
| | |_|/ | |/| | | | | | | | | | | | | | | | | | | | | | This implements vertex and edge contraction as functions that return new graph objects with the specified vertices or edge contracted. This fixes issue #1057.
* | | | Add our names to creditsKonstantinos Karakatsanis2015-04-291-1/+2
| | | |
* | | | Update release notes.chebee7i2015-04-291-2/+7
|/ / /
* | | Add periods.chebee7i2015-04-241-6/+6
| | |
View Lorry Controller Status