delta/python-packages/networkx.git/doc/reference/algorithms/index.rst, branch main github.com: networkx/networkx.git MAINT: Fix sphinx build errors and warnings (#5571) 2022-04-25T15:22:28+00:00 Mridul Seth seth.mridul@gmail.com 2022-04-25T15:22:28+00:00 a51261a1d1fa1ea3ae73906ba592661938c7e3cb * Add polynomials to the algorithms toctree * fix indents for sphinx 
* Add polynomials to the algorithms toctree

* fix indents for sphinx
 adds dedensification function (#4240) 2020-11-10T02:10:55+00:00 Douglas Fenstermacher douglas.fenstermacher@gmail.com 2020-11-10T02:10:55+00:00 0e7abbad9f317ca92fddeff891a972bf5059d6aa * adds dedensification function, documentation, and examples * rm unnecessary lines. Co-authored-by: Ross Barnowski <rossbar@berkeley.edu> 
* adds dedensification function, documentation, and examples

* rm unnecessary lines.

Co-authored-by: Ross Barnowski <rossbar@berkeley.edu>
 Docs update (#4161) 2020-08-16T04:04:29+00:00 Dan Schult dschult@colgate.edu 2020-08-16T04:04:29+00:00 256d1fc47ce440e2f55b16c0d8474f7152a6f68a * Fixes #3955 (boundary_expansion docs) * add to docs for steiner_tree * Add missing functions to docs. Thanks to #4111 * Doc fixups * Put filters onto the doc pages. * Add @jamestrimble doc compare script to repo and expand * Fix latex syntax in docs for trophic * more latex corrections * deprecate edge_betweeness and betweeness_centrality_source. warnings and add to list of deprecations * Use docs to identify hopcrfot_karo_matching and maximum_matching * remove underscore from _naive_greedy_modularity_communities * cite James Trimble for code that finds missing functions * Update parallel_betweenness example to avoid deprecated function betweenness_centrality_source should be replaced by betweenness_centrality_subset in plot_parallel_betweenness. find _naive_greedy and change name * tweak 
* Fixes #3955 (boundary_expansion docs)

* add to docs for steiner_tree

* Add missing functions to docs. Thanks to #4111

* Doc fixups

* Put filters onto the doc pages.

* Add @jamestrimble doc compare script to repo and expand

* Fix latex syntax in docs for trophic

* more latex corrections

* deprecate edge_betweeness and betweeness_centrality_source.

warnings and add to list of deprecations

* Use docs to identify hopcrfot_karo_matching and maximum_matching

* remove  underscore from _naive_greedy_modularity_communities

* cite James Trimble for code that finds missing functions

* Update parallel_betweenness example to avoid deprecated function

betweenness_centrality_source should be replaced by
betweenness_centrality_subset in plot_parallel_betweenness.

find _naive_greedy and change name

* tweak
 ENH: Add new graph_hashing feature 2020-07-07T20:13:08+00:00 Carlos G. Oliver carlos.gonzalez.oliver@gmail.com 2020-07-07T20:13:08+00:00 167b47f784626c3b45a3802c84f681c649c9757b Adds graph_hashing module containing the Weisfeiler Lehman algorithm for hashing graphs. Co-authored-by: Ross Barnowski <rossbar@berkeley.edu> 
Adds graph_hashing module containing the Weisfeiler Lehman
algorithm for hashing graphs.

Co-authored-by: Ross Barnowski <rossbar@berkeley.edu>
 Add algorithms for regular graphs (#3925) 2020-06-26T02:02:54+00:00 Camden Cheek camden@ccheek.com 2020-06-26T02:02:54+00:00 dcfba2899ac39a225a3ba8ed0158517f09ef3799 * Adds the functions is_regular, is_k_regular, and k_factor. The functions `is_regular` and `is_k_regular` are fairly self-explanatory. The `k_factor` function implements an algorithm for computing the k-factor of a graph. The algorithm is described in "An algorithm for computing simple k-factors" (Meijer, H., Núñez-Rodríguez, Y., & Rappaport, D. 2009). * Remove numpy dependency * Implement PR feedback * Add documentation and export for algorithms.regular 
* Adds the functions is_regular, is_k_regular, and k_factor.

The functions `is_regular` and `is_k_regular` are fairly self-explanatory. The
`k_factor` function implements an algorithm for computing the k-factor
of a graph. The algorithm is described in "An algorithm for computing simple
k-factors" (Meijer, H., Núñez-Rodríguez, Y., & Rappaport, D. 2009).

* Remove numpy dependency

* Implement PR feedback

* Add documentation and export for algorithms.regular
 add d-separation algorithm (#3974) 2020-06-05T21:08:40+00:00 arunwise arunwise@gmail.com 2020-06-05T21:08:40+00:00 8bad036f7a38686b389fb9c140e0ca20ed93be35 This PR adds a d-separation algorithm for use in causal inference. 
This PR adds a d-separation algorithm for use in causal inference.
 Fix sphinx errors And add links to single_source_dijkstra in docs for dijkstra_path/length (#3638) 2019-10-08T03:52:46+00:00 Dan Schult dschult@colgate.edu 2019-10-08T03:52:46+00:00 5469ddab8befddee024bb4bb149c1adb57dca5eb * Add links to single_source_dijkstra in docs for dijkstra_path/length Fixes #3618 * Fix errors in sphinx build 
* Add links to single_source_dijkstra in docs for dijkstra_path/length

Fixes #3618

* Fix errors in sphinx build
Implemented Euler Path functions (#3399) 2019-10-01T21:47:21+00:00 Jacob 47821203+ja-ox@users.noreply.github.com 2019-10-01T21:47:21+00:00 d7d119e65042ece00129efa6fb0510d0672796b1 * Added Euler Path functions. Added functions to test for and find an Euler path in a graph. Previous functions only accommodate Euler circuits/cycles (an Euler path that starts and ends on the same node). * Added tests for Euler Path functions. Added initial test classes and tests for new Euler Path related functions added to euler.py * Added missing local imports. Added missing local imports for new tests. * Update euler.py * Changed _find_path_start to find_path_start Changed 'hidden' function to 'public' for importability in tests. * Changed references to _find_path_start Changed references to _find_path_start to find_path_start (as per in main file euler.py). * Corrected errors in test cases. Corrected errors in test cases. Typo equals instead of equal, and 'Digraph' instead of nx.diGraph. * Fixed misplaced bracket. * Fixed test example. * Fix missing bracket. * Added warning about source argument values. * Fix up docs for eulerian path function. pycodestyle, etc * change tests to use name _find_path_start * remove unicode minus sign in doc_strings latex having trouble with * Update docs for euler and index 
* Added Euler Path functions.

Added functions to test for and find an Euler path in a graph. Previous functions only accommodate Euler circuits/cycles (an Euler path that starts and ends on the same node).

* Added tests for Euler Path functions.

Added initial test classes and tests for new Euler Path related functions added to euler.py

* Added missing local imports.

Added missing local imports for new tests.

* Update euler.py

* Changed _find_path_start to find_path_start

Changed 'hidden' function to 'public' for importability in tests.

* Changed references to _find_path_start

Changed references to _find_path_start to find_path_start (as per in main file euler.py).

* Corrected errors in test cases.

Corrected errors in test cases. Typo equals instead of equal, and 'Digraph' instead of nx.diGraph.

* Fixed misplaced bracket.

* Fixed test example.

* Fix missing bracket.

* Added warning about source argument values.

* Fix up docs for eulerian path function. pycodestyle, etc

* change tests to use name _find_path_start

* remove unicode minus sign in doc_strings latex having trouble with

* Update docs for euler and index
Add missing link to asteroidal docs 2019-09-16T21:27:55+00:00 Jarrod Millman jarrod.millman@gmail.com 2019-09-16T19:42:39+00:00 3160d3d58adfc5c4e6a25bd623e0eb0497c9fc43 






Adding non-randomness measures for graphs (#3515)
2019-07-20T15:24:59+00:00

Erwan Le Merrer
elemerrer@acm.org

2019-07-20T15:24:59+00:00

74430264c675af99970b294ce90db75080170c40

* Adding non-randomness measures for graphs

* Adding doc files

* Bux fix in .rst content

* Travis bugs fixing attempt

* Travis bug: numpy import problem

* Travis bug: numpy import problem in test_non_randomness

* following Dan s comments

* following Dan s comments #2

* following Dan s comments #3





* Adding non-randomness measures for graphs

* Adding doc files

* Bux fix in .rst content

* Travis bugs fixing attempt

* Travis bug: numpy import problem

* Travis bug: numpy import problem in test_non_randomness

* following Dan s comments

* following Dan s comments #2

* following Dan s comments #3