summaryrefslogtreecommitdiff
path: root/doc/source/reference
Commit message (Expand)AuthorAgeFilesLines
* Fix some sphinx formatting errorsDan Schult2015-10-0410-26/+58
* Updated documentation building.Neil2015-08-311-1/+1
* Merge pull request #1719 from dschult/minor_doc_changesAric Hagberg2015-08-082-2/+3
|\
| * minor changes related to _iter removalDan Schult2015-08-072-2/+3
* | Update news to include 1.10 release highlightsDan Schult2015-08-071-0/+35
|/
* Merge pull request #1676 from MridulS/api2.0Dan Schult2015-08-072-2/+175
|\
| * Update release notes for 2.0 and migration guideMridul Seth2015-07-312-76/+69
| * Add a guide for moving from 1.xx to 2.0Mridul Seth2015-07-251-0/+117
| * Update 2.0 notesMridul Seth2015-07-251-0/+63
| * fix docs after merging #1577SanketDG2015-06-272-12/+11
| * Merge pull request #1577 from SanketDG/maximum_spanningchebee7i2015-06-222-0/+43
| |\
| | * move *_edges functions to top-level and update release notesSanketDG2015-06-221-17/+10
| | * add and update release notes in release_2.0.rstSanketDG2015-06-221-0/+48
| | * add maximum/minimum_spanning_edges and testsSanketDG2015-06-191-2/+2
| | * remove minimum/maximum_spanning_edges and prim_mstSanketDG2015-06-111-3/+1
| | * add documentation for maximum_spanning_tree, pep8 fixes and fix #1575SanketDG2015-06-101-0/+3
| | * add _optimum_spanning_edges and maximum_spanning_edgesSanketDG2015-06-091-0/+1
* | | Merge master into iter_refactorDan Schult2015-08-074-11/+69
* | | Update doc/source/referenceMridul Seth2015-07-144-20/+4
* | | Merge pull request #1588 from MridulS/neigbhorsiterDan Schult2015-06-174-4/+0
|\ \ \
| * | | Remove neighbors_iter, G.neighbors() now returns an iterator instead of listMridul Seth2015-06-124-4/+0
| | |/ | |/|
* | | Remove edges_iter, G.edges() now returns an iterator instead of listMridul Seth2015-06-174-8/+0
* | | Merge remote-tracking branch 'upstream/iter_refactor' into iter_refactorMridul Seth2015-06-174-4/+0
|\ \ \ | |_|/ |/| |
| * | Makes Graph.nodes() return iterator instead of listJeffrey Finkelstein2015-06-114-4/+0
| |/
* | Update doc/source/reference/algorithms.centrality.rstMridul Seth2015-06-161-4/+9
* | Update link to historical contributions.chebee7i2015-06-131-1/+1
* | Merge pull request #1597 from hagberg/doc-fixeschebee7i2015-06-135-107/+5
|\ \
| * | Missing spaceAric Hagberg2015-06-131-1/+1
| * | 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.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
* 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
* Merge pull request #1501 from jtorrents/refactor-connected-componentsAric Hagberg2015-05-101-0/+10
|\
| * 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
* | 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
|\ \ | |/ |/|
| * 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
|\ \
| * | Solve merge conflictsThodoris Sotiropoulos2015-05-051-5/+5
| * | Implement Johnson's algorithm for shortest pathsThodoris Sotiropoulos2015-05-052-0/+6