Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion build/pkgs/ipywidgets/distros/conda.txt
Original file line number Diff line number Diff line change
@@ -1 +1 @@
ipywidgets<8.0.0
ipywidgets>=7.5.1
2 changes: 1 addition & 1 deletion build/pkgs/networkx/distros/conda.txt
Original file line number Diff line number Diff line change
@@ -1 +1 @@
networkx<3.0,>=2.4
networkx<3.3,>=2.4
2 changes: 1 addition & 1 deletion build/pkgs/networkx/install-requires.txt
Original file line number Diff line number Diff line change
@@ -1 +1 @@
networkx >=2.4, <3.2
networkx >=2.4, <3.3
2 changes: 1 addition & 1 deletion build/pkgs/scipy/distros/conda.txt
Original file line number Diff line number Diff line change
@@ -1 +1 @@
scipy<1.11,>=1.5
scipy<1.12,>=1.5
10 changes: 5 additions & 5 deletions src/sage/graphs/generic_graph.py
Original file line number Diff line number Diff line change
Expand Up @@ -5102,13 +5102,13 @@ def cycle_basis(self, output='vertex'):
A cycle basis in Petersen's Graph ::

sage: g = graphs.PetersenGraph()
sage: g.cycle_basis() # needs networkx
sage: g.cycle_basis() # needs networkx, random (changes in networkx 3.2)
[[1, 6, 8, 5, 0], [4, 9, 6, 8, 5, 0], [7, 9, 6, 8, 5],
[4, 3, 8, 5, 0], [1, 2, 3, 8, 5, 0], [7, 2, 3, 8, 5]]

One can also get the result as a list of lists of edges::

sage: g.cycle_basis(output='edge') # needs networkx
sage: g.cycle_basis(output='edge') # needs networkx, random (changes in networkx 3.2)
[[(1, 6, None), (6, 8, None), (8, 5, None), (5, 0, None),
(0, 1, None)], [(4, 9, None), (9, 6, None), (6, 8, None),
(8, 5, None), (5, 0, None), (0, 4, None)], [(7, 9, None),
Expand Down Expand Up @@ -5273,17 +5273,17 @@ def minimum_cycle_basis(self, algorithm=None, weight_function=None, by_weight=Fa
[[1, 2, 3], [1, 2, 3, 4], [5, 6, 7]]
sage: sorted(g.minimum_cycle_basis(by_weight=False))
[[1, 2, 3], [1, 3, 4], [5, 6, 7]]
sage: sorted(g.minimum_cycle_basis(by_weight=True, algorithm='NetworkX')) # needs networkx
sage: sorted(g.minimum_cycle_basis(by_weight=True, algorithm='NetworkX')) # needs networkx, random (changes in networkx 3.2)
[[1, 2, 3], [1, 2, 3, 4], [5, 6, 7]]
sage: g.minimum_cycle_basis(by_weight=False, algorithm='NetworkX') # needs networkx
sage: g.minimum_cycle_basis(by_weight=False, algorithm='NetworkX') # needs networkx, random (changes in networkx 3.2)
[[1, 2, 3], [1, 3, 4], [5, 6, 7]]

::

sage: g = Graph([(1, 2), (2, 3), (3, 4), (4, 5), (5, 1), (5, 3)])
sage: sorted(g.minimum_cycle_basis(by_weight=False))
[[1, 2, 3, 5], [3, 4, 5]]
sage: sorted(g.minimum_cycle_basis(by_weight=False, algorithm='NetworkX')) # needs networkx
sage: sorted(g.minimum_cycle_basis(by_weight=False, algorithm='NetworkX')) # needs networkx, random (changes in networkx 3.2)
[[1, 2, 3, 5], [3, 4, 5]]

TESTS::
Expand Down