Thanks for reporting this issue. I have opened an issue
(https://github.com/sagemath/sage/issues/35889) and will propose a fix asap.
On Sunday, July 2, 2023 at 6:37:45 PM UTC+2 Georgi Guninski wrote:
> You definitely can construct graph with incomparable vertices
> and they worked as expected in python2. python3 regressed them
> and devs are doing workarounds.
>
> The new testace is:
> G=Graph([("A",1)])
> G.feedback_vertex_set()
> ===
> File /home/sc_serv/sage/src/sage/graphs/connectivity.pyx:287, in
> sage.graphs.connectivity.connected_component_containing_vertex()
> 285
> 286 if sort:
> --> 287 c.sort()
> 288 return c
>
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To view this discussion on the web visit
https://groups.google.com/d/msgid/sage-devel/2cc9c88f-8b27-4b35-b9b7-bf56de2e1a41n%40googlegroups.com.
