summaryrefslogtreecommitdiff
path: root/networkx/algorithms/bridges.py
Commit message (Collapse)AuthorAgeFilesLines
* Fixed unused root argument in has_bridges (#5846)Juanita Gomez2022-07-221-1/+4
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | * Fixed unused root argument in has_bridges * Verify if root is in graph in chain_decomposition function * Fix bridges function returning only bridges in connected component of root * Apply suggestions from code review Co-authored-by: Ross Barnowski <rossbar@berkeley.edu> * Apply suggestions from code review Co-authored-by: Dan Schult <dschult@colgate.edu> * Fix bridge test when root is not in G * Rewrite code to make it more readable * Add missing tests for chain decomposition and bridges * Apply suggestions from code review Co-authored-by: Dan Schult <dschult@colgate.edu> Co-authored-by: Ross Barnowski <rossbar@berkeley.edu> * Apply suggestions from code review Co-authored-by: Dan Schult <dschult@colgate.edu> Co-authored-by: Ross Barnowski <rossbar@berkeley.edu> Co-authored-by: Dan Schult <dschult@colgate.edu>
* Improve bridges documentation (#5519)Dilara Tekinoglu2022-04-191-0/+11
| | | | | | | * Fix bridges documentation * Revert source code modification * Revert raise errors for multigraphs
* Add support for multigraphs to nx.bridges. (#5397)Lucas H. McCabe2022-03-231-6/+13
| | | | | Adds support for multigraphs to the nx.bridges function. Co-authored-by: Ross Barnowski <rossbar@berkeley.edu>
* Format w/ blackJarrod Millman2020-07-101-8/+8
|
* Remove superfluous encoding informationJarrod Millman2019-11-111-1/+0
|
* Remove boiler plate from top of modulesJarrod Millman2019-11-111-8/+0
| | | | | | | | | 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.
* Update copyrightJarrod Millman2019-03-301-1/+1
|
* Fixing typo in bridges module (#2907)Guillaume Plique2018-03-191-2/+2
|
* Update copyrightJarrod Millman2018-01-201-1/+1
|
* Fix links (#2663)Jarrod Millman2017-09-111-1/+1
| | | | | | * Fix links * Comply with pep8
* Comply with pep8Jarrod Millman2017-08-141-0/+1
|
* Use dollar sign for inline mathJarrod Millman2017-08-141-8/+8
|
* [ENH] Added functions for k-edge-connected components/subgraphs (#2554)Jon Crall2017-08-081-5/+13
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | * Initial commit of k-edge-ccs and subgraphs Added implementation of k-edge-ccs Added implementation of k-edge-subgraphs Added tests for both local-cc and subgraph versions. Added assert to test to verify their difference. * imported appropriate utils and switched to random_powerlaw_tree_sequence * Sped up tests. Added new directed and five clique test case * Fixed docstrings and __init__ Added SeeAlso docstring and added algorithms to toplevel __init__ Fixed author and cleaned docstrings. Removed profiling code. Fixed spelling error. Registerd module for doc autogeneration. Updated bridges.py docstring. * Fixed doctest section underlines * removed test main * Added workaround for classmethod notimplemented and tests * Fixed k=1 case for directed graphs and increased coverage
* Add local_bridges ideas from #2273 (#2525)Dan Schult2017-07-191-2/+60
| | | | | | Resolves #2273 also discussed in #903 @erotemic Perhaps parts could be used (or improved by) #2459
* Adds linear-time bridge-finding algorithm. (#2306)jfinkels2017-07-191-0/+123
This bridge-finding algorithm is implemented using the `chain_decomposition` function.
View Lorry Controller Status