| Commit message (Collapse) | Author | Age | Files | Lines |
|---|
| | |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
* added docstrings examples for clique.py
* Update networkx/algorithms/approximation/clique.py
Co-authored-by: Ross Barnowski <rossbar@berkeley.edu>
* Update networkx/algorithms/approximation/clique.py
Co-authored-by: Ross Barnowski <rossbar@berkeley.edu>
* adding corrections
* adding corrections
* adding corrections to examples
* adding corrections
---------
Co-authored-by: Ross Barnowski <rossbar@berkeley.edu>
|
| |
|
|
|
|
|
|
|
| |
* updated functions to raise an exception for directed and multigraph
* added maximum_independent_set in the clique module and and updated tests
* updated docs
* module docstring
|
| |
|
|
|
|
|
| |
* Setup for numpydoc.
* Add to doc requirements.
* Replace napoleon with numpydoc in conf.py.
* DOC: Fixups from numpydoc.
|
| | |
|
| | |
|
| | |
|
| |
|
|
|
|
|
|
|
| |
The copyright and author stuff is not necessary, out-of-date,
and inconsistent. It takes up visual space and is a pain to
police everyone doing the same thing on the top of the module.
Git handles authorship in a comprehensive and authoritative way.
The LICENSE.txt file applies to all project code.
|
| | |
|
| | |
|
| |
|
|
|
|
|
|
| |
* Fix several DeprecationWarning: invalid escape sequence
Signed-off-by: Mickaël Schoentgen <contact@tiger-222.fr>
* Restore docstring of generalized_degree()
|
| | |
|
| | |
|
| |
|
|
|
|
|
|
|
|
| |
* Adds a large clique size heuristic function
This commit creates a new package, `networkx.algorithms.heuristic`, and
a new module within that package containing a function for finding the
size of a large clique in a graph.
* Fix typos in docs
|
| |
|
|
|
|
| |
* Fix links
* Comply with pep8
|
| | |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
* Update code to prepare for melding graphviews
* Meld graphviews into graph classes
* Cleanup subgraph calling sign. and remove duplicate code
* Add some tests for raising exceptions
* update edge_kcomponents to avoid readonly views.
* Add root_graph attribute and tests
Update tests for root_graph as well as fresh_copy.
I left fresh_copy as an attribute even with root_graph
because a view might switch the data structure of the
view from directed to undirected. Going to the root_graph.__class__
may not give you what you need to create a graph like the view.
Fresh_copy gives a null graph with the directed/multi type of that
view or graph.
|
| |
|
|
|
|
|
|
|
|
| |
Adds the `with_data` keyword argument to the `Graph.copy()` method,
which specifies whether the graph, node, and edge data will be included
in the copy of the graph object.
This commit also updates algorithms that include a call to
`Graph.copy()` to use `with_data=False` if they really do not need a
copy of the data.
|
| |
|
|
|
|
| |
Before, the maximum clique was chosen from a set of candidate cliques
according to the subset ordering on sets. This commit changes the code
to choose the maximum clique according to clique size.
|
| | |
|
| | |
|
| |
|
|
| |
Addresses #714
|
|
|
Addresses #714
|
