#7724: breadth/depth first search and basic connectivity for c_graphs
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.3.1
Component: graph theory | Keywords:
Work_issues: needs rebase | Author: Nathann Cohen
Upstream: N/A | Reviewer: Robert Miller
Merged: |
----------------------------+-----------------------------------------------
Changes (by ncohen):
* status: needs_work => needs_review
Comment:
Hello !!
I could not reproduce your merging conflict, though as I had applied the
patch I use the occasion to add a few other things... You will find in
this new version of the patch
* A function beadth_dirst_search ( with optional arguments ``reverse``
and ``ignore_direction``
* A function ``depth_first_search`` with the same paremeters
* A function ``is_connected``
* A function ``is_strongly_connected``
* I needed to know inside the graph backend whether the graph was
directed or not : I thought for some time about it, and ended up adding to
the constructors of ``Graph`` and ``DiGraph`` a line
``self._backend.directed = True/False`` according to the situation.
* I also modified graph.py so that it would use the functions defined
in c_graph whenever possible, and NetworkX otherwise
And with this, we should be another step closer.. :-)
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7724#comment:5>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
