#18564: Boost Edge Connectivity
-------------------------------------+-------------------------------------
Reporter: borassi | Owner: borassi
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.8
Component: graph theory | Resolution:
Keywords: Boost, | Merged in:
connectivity | Reviewers:
Authors: Michele Borassi | Work issues:
Report Upstream: N/A | Commit:
Branch: | 7481889e9795e22c5d7ea9b42335f14548c9c636
u/borassi/boost_edge_connectivity | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by borassi):
Hello,
{{{
{{{
sage: digraphs.Circuit(10).edge_connectivity(boost=True,vertices=True)
The directed edge connectivity algorithm implemented in the Boost graph
library is not reliable. The result could be wrong.
[1, [[0, 1]], [[0, 1, 2, 3, 4, 5, 6, 7, 8, 9], []]]
}}}
}}}
I think I have problems understanding which is the desired output. It is
clear that if we have a directed cycle `(0,1,...,9)`, the connectivity is
1 (if we eliminate an edge, the graph will not be strongly connected
anymore). However, I have problems understanding which sets of vertices we
are looking for. For instance, if we cut `(0,1)`, should the two sets be
`{1},{2,3,...,0}`, or maybe `{1,2,3},{4,5,...,9,0}`, or any division of
the remaining graph in two components is fine?
--
Ticket URL: <http://trac.sagemath.org/ticket/18564#comment:37>
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.
