summaryrefslogtreecommitdiff
path: root/networkx
Commit message (Expand)AuthorAgeFilesLines
* Bump release versionJarrod Millman2023-04-041-1/+1
* Designate 3.1 releasenetworkx-3.1Jarrod Millman2023-04-041-1/+1
* Fix typos (#6620)Harri Nieminen2023-04-0425-42/+42
* Fix module docstring format for ismags reference article. (#6611)Ross Barnowski2023-04-031-14/+13
* Better default alpha value for viz attributes in gexf writer (#6612)Ross Barnowski2023-04-032-1/+11
* Minor docs/test maintenance (#6614)Ross Barnowski2023-04-032-2/+5
* Fixed method description in ismags.py (#6600)Navya Agarwal2023-04-021-2/+2
* corrections to docstring of `weisfeiler_lehman_subgraph_hashes` (#6598)Aaron Z2023-04-011-7/+12
* Bump release versionJarrod Millman2023-03-301-1/+1
* Designate 3.1rc0 releasenetworkx-3.1rc0Jarrod Millman2023-03-301-1/+1
* Added Docstring Example for Bidirectional Shortest Path (#6570)Vanshika Mishra2023-03-291-0/+7
* Fixed return type inconsistencies in weighted.py (#6568)Navya Agarwal2023-03-281-7/+9
* Test dispatching via nx-loopback backend (#6536)Jim Kitchen2023-03-285-8/+112
* add simple cycle enumerator for undirected class (#6461)Kelly Boothby2023-03-292-88/+1131
* Deprecate shortest_path functions to have consistent return values in v3.3 (#...Dan Schult2023-03-283-0/+21
* Optimize _single_shortest_path_length function (#6299)Tortar2023-03-281-23/+22
* Fixed return type inconsistencies in shortest path methods documentation (#6528)Navya Agarwal2023-03-281-3/+3
* Improve test coverage for redundancy.py (#6551)Navya Agarwal2023-03-281-0/+6
* improve test coverage for branchings.py (#6523)Alimi Qudirah2023-03-231-0/+53
* Add docstring examples to boundary.py (#6487)Navya Agarwal2023-03-231-0/+28
* Add example script for mst (#6525)Purvi Chaurasia2023-03-231-0/+1
* Add docstring examples to dag.py (#6491)Navya Agarwal2023-03-231-0/+7
* Update pre-commit (#6545)Jarrod Millman2023-03-2313-24/+24
* Fixed bug k_truss doesn't raise exception for self loops (#6521)Purvi Chaurasia2023-03-211-2/+9
* Update docstring of paley graph (#6529)Paula Pérez Bianchi2023-03-211-7/+7
* Use generator to limit memory footprint of read_graph6. (#6519)Ross Barnowski2023-03-191-1/+1
* Updating removing explicit import for communities (#6459)Lukong Anne2023-03-1712-98/+78
* Improve test coverage for mst.py and bug fix in prim_mst_edges() (#6486)Navya Agarwal2023-03-172-0/+59
* Improve test coverage for edgelist.py (#6507)Navya Agarwal2023-03-171-0/+37
* Fix len operation of UnionAtlas (#6478)Dan Schult2023-03-142-3/+3
* Add docstring example to weighted.py (#6497)Navya Agarwal2023-03-141-0/+9
* Improve test coverage for astar.py (#6504)Navya Agarwal2023-03-141-0/+14
* tweak `test_override_dispatch` to allow G keyword (#6499)Erik Welch2023-03-131-1/+7
* Fix reference formatting in generator docstring. (#6493)Ross Barnowski2023-03-121-2/+2
* Ignore weakrefs when testing for memory leak (#6466)Erik Welch2023-03-111-1/+14
* Dispatch more BFS-based algorithms (#6467)Erik Welch2023-03-115-0/+9
* Fix negative edge cycle function raising exception for empty graph (#6473)Purvi Chaurasia2023-03-113-1/+7
* Allow first argument to be passed as kwarg in dispatcher (#6471)Dan Schult2023-03-112-1/+21
* Add docstring for dorogovtsev_goltsev_mendes generator (#6450)Ross Barnowski2023-03-021-2/+31
* Clean up similarity.py and use dataclasses for storing state (#5831)Mridul Seth2023-02-281-40/+28
* Added two tests for convert_numpy (#6455)Michael Holtz2023-02-281-0/+14
* Doc upgrade paley graph (#6399)Paula Pérez Bianchi2023-02-281-10/+10
* Start using ruff for pyupgrade and isort (#6441)Mridul Seth2023-02-251-1/+3
* Lint using Ruff (#6371)danieleades2023-02-19106-524/+505
* Fix reference in line.py-inverse_line_graph (#6434)Claudia Madrid2023-02-151-3/+4
* Update developer requirements (#6429)Jarrod Millman2023-02-1465-126/+83
* spectral bisection for graphs using fiedler vector (#6404)Mridul Seth2023-02-132-1/+88
* Added tests to test_directed.py. (#6208)Michael Holtz2023-02-121-0/+44
* Fix docstring heading title. (#6424)Ross Barnowski2023-02-121-4/+4
* Add dispatching to more shortest path algorithms (#6415)Erik Welch2023-02-083-0/+17