index
:
delta/python-packages/networkx.git
MridulS-patch-1
attrgraph
beam-log-2
circleci-project-setup
digraph-edge-subgraph
doc-isom-orderable
doc-typo
docdraft
docs-for-v1.11
dschult-patch-1
dschult-patch-gml
error-message-configuration-model
error-message-eccentricity
fix-d-separation-conflicts
gh-pages
iter_refactor
kl-encoding
main
master
networkx-1.10
nx-sparse
remove-beam-notes
remove-conda
revert-1806-patch-numpy-compatible
revert-3507-master
revert-5156-pin-pyparsing
scipy-pandas-310
v1.10
v1.10.1
v1.11
v1.9
v1.9.1
v2.5
v2.6
v2.8
github.com: networkx/networkx.git
summary
refs
log
tree
commit
diff
log msg
author
committer
range
path:
root
/
networkx
/
algorithms
/
connectivity
/
kcutsets.py
Commit message (
Expand
)
Author
Age
Files
Lines
*
Update pre-commit (#6545)
Jarrod Millman
2023-03-23
1
-1
/
+1
*
Lint using Ruff (#6371)
danieleades
2023-02-19
1
-1
/
+1
*
Added an example in all_pairs_node_connectivity (#6126)
Paula Pérez Bianchi
2022-11-01
1
-3
/
+4
*
Use isort with pre-commit to enforce import guidelines (#5659)
Mridul Seth
2022-06-02
1
-1
/
+2
*
Format w/ black
Jarrod Millman
2020-07-10
1
-34
/
+28
*
Upgrade to Py36 syntax
Jarrod Millman
2020-01-01
1
-2
/
+2
*
Convert %-format to fstring
Jarrod Millman
2020-01-01
1
-8
/
+8
*
Remove superfluous encoding information
Jarrod Millman
2019-11-11
1
-1
/
+0
*
Remove boiler plate from top of modules
Jarrod Millman
2019-11-11
1
-2
/
+0
*
PEP8 fixes
Jarrod Millman
2019-10-18
1
-8
/
+8
*
Fix bugs in all_node_cuts, address #3025 (#3039)
Haochen Wu
2018-07-24
1
-36
/
+76
*
Misc. typos (#2872)
luzpaz
2018-02-14
1
-1
/
+1
*
Pep8 fixes
Jarrod Millman
2018-01-20
1
-10
/
+11
*
Simplify base classes. (#2604)
Dan Schult
2017-08-12
1
-1
/
+1
*
Next attempt to meld graphviews with base classes (#2593)
Dan Schult
2017-08-12
1
-2
/
+1
*
Fix all_node_cuts corner cases: cycle and complete graphs.
Jordi Torrents
2016-02-05
1
-0
/
+17
*
Allows copying a graph without attribute data.
Jeffrey Finkelstein
2015-12-17
1
-1
/
+1
*
Remove degree_iter(),now degree() returns an integer for single node and iter...
Mridul Seth
2015-06-27
1
-2
/
+1
*
Remove edges_iter, G.edges() now returns an iterator instead of list
Mridul Seth
2015-06-17
1
-1
/
+1
*
Use the recently exposed antichains function.
Jordi Torrents
2015-04-27
1
-43
/
+5
*
Cosmetic changes to all_node_cuts implementation.
Jordi Torrents
2015-03-17
1
-6
/
+6
*
Never repeat node cut sets in all_node_cuts output.
Jordi Torrents
2015-03-12
1
-2
/
+7
*
Add credit for `antichains_generator` to Peter Jipsen and Franco Saliola.
Jordi Torrents
2015-03-10
1
-0
/
+9
*
Use a `for` loop instead of a `while` for iterating over antichains.
Jordi Torrents
2015-03-07
1
-12
/
+7
*
Move is_connected test into all_node_cuts.
Jordi Torrents
2015-03-06
1
-5
/
+6
*
Add all minimum-size k node cutsets algorithm.
Jordi Torrents
2015-03-05
1
-0
/
+211
