#18564: Boost Edge Connectivity
---------------------------------------+------------------------
Reporter: borassi | Owner: borassi
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.8
Component: graph theory | Resolution:
Keywords: Boost, connectivity | Merged in:
Authors: Michele Borassi | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
---------------------------------------+------------------------
Changes (by {'newvalue': u'Michele Borassi', 'oldvalue': ''}):
* author: => Michele Borassi
* cc: ncohen, dcoudert, jdemeyer, jpflori, slelievre, Snark, vbraun,
wstein (added)
* component: PLEASE CHANGE => graph theory
* owner: => borassi
* keywords: => Boost, connectivity
* type: PLEASE CHANGE => enhancement
Old description:
New description:
This is a first step in including Boost Graph Library
(http://trac.sagemath.org/ticket/17966). I would like to implement the
edge connectivity algorithm by converting a given Sage graph into a Boost
graph, apply the Boost edge connectivity algorithm, and convert the
result.
Since in my preliminary coding I had several problems with generic types,
I will only restrict to vector-stored adjacency lists, leaving genericity
to a future ticket.
--
--
Ticket URL: <http://trac.sagemath.org/ticket/18564#comment:1>
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.
