#18564: Boost Edge Connectivity
-------------------------------------+-------------------------------------
Reporter: borassi | Owner: borassi
Type: enhancement | Status: new
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: | fe40c540c67848ae4cb694921501185b0cd4f045
u/borassi/boost_edge_connectivity | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by borassi):
This version lets us use Boost graph library to compute edge connectivity.
Probably it is not the cleanest way to do it, but at least it works. I
am looking for suggestions on how to improve the code, in order to make it
more readable:
* is it better to use only Boost in C++ and Cython for the interface, or
write the code in C++ and use Cython to convert the results? In the first
case, we might have problems with generic types.
* should we only keep translation capabilities, or should we also add a
new backend? In other words, do we need Boost for linear-time or O(n log
n) time algorithms?
Some benchmark:
{{{
sage: G = graphs.RandomGNM(100,1000)
sage: %timeit G.edge_connectivity()
1 loops, best of 3: 10.7 s per loop
sage: %timeit G.to_boost_graph().edge_connectivity()
100 loops, best of 3: 2.04 ms per loop
}}}
Thank you very much!
--
Ticket URL: <http://trac.sagemath.org/ticket/18564#comment:4>
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.
