Skip to content

Actions: sagemath/sage

All workflows

Actions

Loading...
Loading

Showing runs from all workflows
119,954 workflow runs
119,954 workflow runs

Filter by Event

Filter by Status

Filter by Branch

Filter by Actor

Synchronize labels
Synchronize labels #40269: Scheduled
September 17, 2024 18:06 16s develop
September 17, 2024 18:06 16s
graphs: StaticSparseBackend (i.e., immutable graphs) sorts the vertices by default
Synchronize labels #40268: Issue #38665 labeled by dcoudert
September 17, 2024 14:37 2s
September 17, 2024 14:37 2s
Publish documentation
Publish documentation #14413: completed by dcoudert
September 17, 2024 14:29 5m 48s
September 17, 2024 14:29 5m 48s
graphs: make init_short_digraph always sort neighbors but without the extra log complexity (2nd try)
Synchronize labels #40267: Pull request #38664 labeled by dcoudert
September 17, 2024 14:11 2s
September 17, 2024 14:11 2s
graphs: make init_short_digraph always sort neighbors but without the extra log complexity (2nd try)
Synchronize labels #40266: Pull request #38664 labeled by dcoudert
September 17, 2024 14:11 2s
September 17, 2024 14:11 2s
graphs: make init_short_digraph always sort neighbors but without the extra log complexity (2nd try)
Synchronize labels #40265: Pull request #38664 unlabeled by dcoudert
September 17, 2024 14:11 3s
September 17, 2024 14:11 3s
Synchronize labels
Synchronize labels #40264: submitted by dcoudert
September 17, 2024 14:11 2s
September 17, 2024 14:11 2s
Synchronize labels
Synchronize labels #40263: submitted by dcoudert
September 17, 2024 13:58 2s
September 17, 2024 13:58 2s
add method is_vertex_cut to (di)graphs
Static check with Pyright #3185: Pull request #38418 synchronize by dcoudert
September 17, 2024 13:50 7m 35s dcoudert:graphs/is_vertex_cut
September 17, 2024 13:50 7m 35s
add method is_vertex_cut to (di)graphs
Build documentation #15348: Pull request #38418 synchronize by dcoudert
September 17, 2024 13:50 39m 32s dcoudert:graphs/is_vertex_cut
September 17, 2024 13:50 39m 32s
add method is_vertex_cut to (di)graphs
Build & Test using Conda #13037: Pull request #38418 synchronize by dcoudert
September 17, 2024 13:50 1h 0m 33s dcoudert:graphs/is_vertex_cut
September 17, 2024 13:50 1h 0m 33s
add method is_vertex_cut to (di)graphs
Build & Test #15336: Pull request #38418 synchronize by dcoudert
September 17, 2024 13:50 1h 9m 17s dcoudert:graphs/is_vertex_cut
September 17, 2024 13:50 1h 9m 17s
add method is_vertex_cut to (di)graphs
Build documentation (PDF) #9993: Pull request #38418 synchronize by dcoudert
September 17, 2024 13:50 1h 30m 39s dcoudert:graphs/is_vertex_cut
September 17, 2024 13:50 1h 30m 39s
add method is_vertex_cut to (di)graphs
Lint #15353: Pull request #38418 synchronize by dcoudert
September 17, 2024 13:50 4m 29s dcoudert:graphs/is_vertex_cut
September 17, 2024 13:50 4m 29s
add method is_vertex_cut to (di)graphs
Synchronize labels #40262: Pull request #38418 synchronize by dcoudert
September 17, 2024 13:50 12s
September 17, 2024 13:50 12s
Publish documentation
Publish documentation #14412: completed by janmenjayap
September 17, 2024 13:47 3m 50s
September 17, 2024 13:47 3m 50s
Implementing is_matching_covered() and is_bicritical()
Static check with Pyright #3184: Pull request #38218 synchronize by janmenjayap
September 17, 2024 13:11 7m 49s janmenjayap:matching_covered_graph
September 17, 2024 13:11 7m 49s
Implementing is_matching_covered() and is_bicritical()
Build documentation #15347: Pull request #38218 synchronize by janmenjayap
September 17, 2024 13:11 36m 14s janmenjayap:matching_covered_graph
September 17, 2024 13:11 36m 14s
Implementing is_matching_covered() and is_bicritical()
Build & Test using Conda #13036: Pull request #38218 synchronize by janmenjayap
September 17, 2024 13:11 1h 10m 24s janmenjayap:matching_covered_graph
September 17, 2024 13:11 1h 10m 24s
Implementing is_matching_covered() and is_bicritical()
Build & Test #15335: Pull request #38218 synchronize by janmenjayap
September 17, 2024 13:11 1h 4m 12s janmenjayap:matching_covered_graph
September 17, 2024 13:11 1h 4m 12s
Implementing is_matching_covered() and is_bicritical()
Build documentation (PDF) #9992: Pull request #38218 synchronize by janmenjayap
September 17, 2024 13:11 1h 30m 28s janmenjayap:matching_covered_graph
September 17, 2024 13:11 1h 30m 28s
Implementing is_matching_covered() and is_bicritical()
Synchronize labels #40261: Pull request #38218 synchronize by janmenjayap
September 17, 2024 13:11 13s
September 17, 2024 13:11 13s
Implemented generators for some small graphs/ digraphs
Synchronize labels #40260: Pull request #38321 unlabeled by dcoudert
September 17, 2024 13:02 2s
September 17, 2024 13:02 2s
Implemented generators for some small graphs/ digraphs
Synchronize labels #40259: Pull request #38321 labeled by dcoudert
September 17, 2024 13:02 2s
September 17, 2024 13:02 2s