| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
* CI/MAINT: drop gdal tests (#5068)
* Unpin gdal.
* Try pinning to 3.3
* Pin setuptools instead.
* remove gdal from workflows
* modularity_max: provide labels to get_edge_data (#4965)
* modularity_max: provide labels to get_edge_data
* test greedy mod communities relabeled separately
* Minor style changes + add note to test.
Co-authored-by: Mathilde Leval <mleval@csod.com>
Co-authored-by: Ross Barnowski <rossbar@berkeley.edu>
* Improvements to greedy_modularity_community (#4996)
* fix docstring importation at naive_greedy_modularity_communities
* add resolution at docstring parameters at modularity_max.py
* use weight arg instead of 'weight' key at greedy_modularity_communities()
* separate test for non contiguous integers as node-labels
* modularity_max: breaking the loop when given community size is reached (#4950)
* modularity_max: allow input of desired number of communities
* import warnings
* format
* format
* improvements according to discussion
* try to manually merge main + resolve conflicts
* add test for n_communities parameter using circular ladder graph
* style of test
* greedy_modularity_communities with digraphs and multi(di)graphs (#5007) (#5007)
* refactor N & m calculation @ greedy_modularity_communities()
* add Newman 'Analysis of weighted networks' @ References
* extend greedy_modularity_communities to DiGraph's
* separate data structures init to a new function
* remove unused 'merges' list
* add @not_implemented_for('directed', 'multigraph') above naive_greedy_modularity_communities()
* add tests for greed_modularity_communities() with directed & directed+weighted
* use nx.all_neighbors() to access successors as well as predecessors at DiGraph's
* extend greedy_modularity_communities() to MultiGraph's
* extend greedy_modularity_communities() to MultiDiGraph's
* refactor: remove encoder/decoder dicts (node-labels are already hashable)
* b pulls data from in_degree isntead of out_degree
* match the sequence of the return values with the docstring reference
* test: modify existing Graphs instead of creating new ones
* dq correction for multi-edges explanation & other minor edits
* CNM -> Clauset-Newman-Moore & isinstance(G, (nx.MultiGraph, nx.MultiDiGraph)) -> G.is_MultiGraph()
* amend @not_implemented_for decorator @ naive_greedy_modularity_communities()
* Allow greedy_modularity_communities to use floating point weights or resolution (#5065)
* revise mapped_queue to separate priority from element
* update max_modularity to use new mapped_queue
* change attribute names h, d to heap, position in MappedQueue
* clean up initialization of data structures and handling of q0
* change i,j,k notation to u,v,w (no indexes since gh-5007)
* Update networkx/utils/mapped_queue.py
Co-authored-by: Ross Barnowski <rossbar@berkeley.edu>
Co-authored-by: Ross Barnowski <rossbar@berkeley.edu>
Co-authored-by: Ross Barnowski <rossbar@berkeley.edu>
Co-authored-by: Mathilde LĂ©val <9384853+mathilde-leval@users.noreply.github.com>
Co-authored-by: Mathilde Leval <mleval@csod.com>
Co-authored-by: Thanasis Mattas <thanasismatt@gmail.com>
Co-authored-by: Martha Frysztacki <martha.frysztacki@kit.edu>
Co-authored-by: Thanasis Mattas <atmattas@physics.auth.gr>
Co-authored-by: Dan Schult <dschult@colgate.edu>
|
| |
|
| |
|
| |
|
|
|
|
|
| |
* Remove default dependencies
* Update release notes
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
* rst double colons for example code
* add nx. prefix to doctest function calls
* Remove one line from 1->2 migration rst file
the line shows code that works for 1.x *and* 2.x.
But it no longer works for all v2.x code. Readers should just use the
next line of code, so no reason to keep this in the file.
* capture output from subplot and rename DiGraph as DG in introduction.rst
* skip running the entire test suite as an example in old_release_log.rst
* doctest of examples
* remove changes to nexp files
|
|
|
|
|
|
|
|
|
|
|
| |
* updated documentation on `descendants_at_distance`
updated documentation only
* Update networkx/algorithms/traversal/breadth_first_search.py
Co-authored-by: Dan Schult <dschult@colgate.edu>
Co-authored-by: Dan Schult <dschult@colgate.edu>
|
|
|
|
|
|
|
|
|
| |
* Deprecate k_nearest_neighbors and fix parts of neighbor degree functions
* Add tests for directed graphs fix errors in "degree"
* tweak text and names
* Remove comment lines of "obsolete code" at bottom of module
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
* Add matrix_market reference stub.
* Add R/W examples to matrix_market stub.
* Add matrix market to toctree.
* Remove irrelevant factoid.
* Re-name according to review suggestion.
|
|
|
| |
fix k_nearest_neighbors defaults signature in deprecation
|
| |
|
| |
|
| |
|
|
|
|
|
|
|
| |
* Remove unused imports and fix minor docstring issues
* inter_community parameter explanation
* fix minor word nit
|
|
|
|
|
|
|
| |
* Add comment about single core CI/CD showing slower parallel output in example script.
* less specific estimate of speedup
Co-authored-by: Dan Schult <dschult@colgate.edu>
|
|
|
|
|
| |
* move partition checking outside private _quotient_graph function
* fix typo
|
| |
|
| |
|
|
|
| |
Remove reference to nonexistant `node_relation` parameter
|
| |
|
| |
|
| |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
* Update read_gml docstring with destringizer ex
Responding to issue 4877 by adding a simple destringizer example to the
read_gml docstring.
* Update doc strings
The documentation stated that the code can read data types other than
str without specifying a destringizer. While the code can write several
other data types, a destringizer is required for any type other than
str. The documentation is repeated in the file and was updated in all 5
places: the gml.py module docstring, as well as the read_gml, parse_gml,
generate_gml, and write_gml docstrings.
Co-authored-by: Randy Weaver <randyweaver@randys-mbp.attlocal.net>
|
|
|
|
|
| |
* Deprecate numeric_mixing_matrix.
* Add deprecation to release notes.
|
|
|
|
|
|
|
|
| |
Update calculation of assortativity coefficients and update
tests to reflect new behavior.
Introduces mapping kwarg to degree_mixing_matrix and remove
0-padded rows/cols from degree_mixing_matrix.
Co-authored-by: Dan Schult <dschult@colgate.edu>
|
|
|
|
|
| |
* fix error in the tests... now original code fails test
Co-authored-by: Dan Schult <dschult@colgate.edu>
|
|
|
|
|
|
|
|
|
|
|
| |
* Fix edge_dfs link in dfs_edges docstring description.
* Returns -> Yields in dfs_edges docstring.
* Fix see also links and add References-style links.
* Update links to dfs_edges f/ edge_dfs docstring.
* Update bfs_edges docstring a la dfs_edges.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
* added argmap decorator
* removed most dependency on decorator
* removed last reference to decorator?
* Made the compilation of argmap-decorated functions lazy to reduce import time.
* black
* reworked try_finally to make cleanup cleaner
* first pass at documentation; general cleanup
* incorporated dschult's comments
* rest formatted docstrings
* added unit tests and fixed a few bugs that cropped up
* Apply suggestions from code review
Co-authored-by: Ross Barnowski <rossbar@berkeley.edu>
Co-authored-by: Dan Schult <dschult@colgate.edu>
* Exapnd docstrings for decorators.py
* * refactored try_finally into a keyword-only argument
* more tweaks to documentation re: @stefanv's comments
* additional unit test for signature-clobbering decorators
* spellcheck my txt and expand new test to help me grok it
* rehash docstrings for sphinx
* rewrite docs to provide some examples where argmap used without @argmap
* doc tweak
* last touches
* documentation clarifications
* run black
* doc review
* remove decorator module from github workflows and INSTALL.rst
* add text to release_dev to describe highlights and improvements here
Co-authored-by: Ross Barnowski <rossbar@berkeley.edu>
Co-authored-by: Dan Schult <dschult@colgate.edu>
|
|
|
|
|
|
|
|
|
|
|
|
| |
* Add local copies of custom node icon pngs.
* Update example to use local images.
* Force FancyArrowPatch to respect tgt distances.
min/max_target_distance kwargs are only supported by FancyArrowPatch.
Force drawing with FAPs and add comment explaining how/why.
* Add seed to layout for reproducibility.
|
|
|
|
|
|
|
| |
* Update arrows default value in draw_networkx.
* Add regression test for draw_networkx.
* Parametrize regression tests to include nx.draw.
|
|
|
|
|
|
|
| |
* Raise ValueError if None is added as a node.
Removed some tests that checked that errors raised when None was a node.
* update tutorial to make a stronger statement about None
|
|
|
|
| |
Allow selection of an edge attribute to be the edge id when writing GraphML.
Adds edge_id_from_attribute kwarg.
|
|
|
|
| |
Decode and preserve GraphML/yEd shape type
and add tests for description and yworks GenericNode
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
* Fix conda instructions
* New idea
* fix to have conda avoid -r in requirements.txt and avoid ~=2.12 which is pip specific
* Hopefully fix macos pypy loading
* try again without wheel?
* Avoid dependencies on PyPy
Co-authored-by: Dan Schult <dschult@colgate.edu>
|
|
|
|
|
|
|
|
|
|
|
| |
* Fix links, use DOI links, wayback machine where required
* Add nx-guides to intersphinx mapping.
* Replace external mpl link w/ intersphinx.
* Update mpl intersphinx mapping.
Co-authored-by: Ross Barnowski <rossbar@berkeley.edu>
|
|
|
|
| |
* Add test case for handling default node attributes from graphML
* Add decode conversion to key defaults analogous to decode_data_elements
|
|
|
|
|
|
|
| |
* spring_layout: ignore 'fixed' nodes not in the graph nodes
* add api change to release notes
Co-authored-by: Dan Schult <dschult@colgate.edu>
|
|
|
| |
The grid table was not properly formatted using reStructuredText Markup which is required by Sphinx.
|
| |
|