#18906: Refactor min spanning tree
-------------------------------------+-------------------------------------
Reporter: borassi | Owner:
Type: defect | Status: needs_review
Priority: major | Milestone: sage-6.8
Component: graph theory | Resolution:
Keywords: Minimum spanning | Merged in:
tree | Reviewers: David Coudert
Authors: Michele Borassi | Work issues:
Report Upstream: N/A | Commit:
Branch: | c0a18032f71897554c59583314116c3c46c085dd
u/borassi/refactor_min_spanning_tree| Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by borassi):
> There is no need for a new method `simplify` since we already have
method `to_simple` in `generic_graph.py`.
You are right: I removed the method, and I call the `to_simple` routine.
> I however fully agree that the `to_simple` method is incorrect since it
starts with `g=self.to_undirected()`... O_o
>
> The best is to improve `to_simple`, and possibly also `allow_loops`,
`allow_multiple_edges`, `remove_loops`, `multiple_edges`, etc. but first
`to_simple`.
I have improved `to_simple` and `allow_multiple_edges`: the user can
choose if the graph is converted to an undirected graph, and which label
should be kept (the minimum, the maximum, or any label).
--
Ticket URL: <http://trac.sagemath.org/ticket/18906#comment:15>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
