#9136: more named graphs
----------------------------+-----------------------------------------------
Reporter: mvngu | Owner: jason, ncohen, rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-wishlist
Component: graph theory | Keywords:
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------+-----------------------------------------------
Comment(by dimpase):
Replying to [comment:17 rlm]:
> Replying to [comment:7 dimpase]:
> > IMHO there is a more fundamental issue here: Sage should handle such
graphs in an efficient way --- just keeping all the edges is pretty much a
waste, in particular for bigger examples with hundreds of vertices...
>
> The underlying architecture is already in place; one needs only to
implement a GraphBackend which represents the graph in question.
Implementing simple methods such as has_edge, has_vertex, etc. one can
then get the rest of the methods automatically. Check out the source!
I am not sure I understand how to implement things like add_vertex() and
add_edge() - as we would start with a permutation group G, the set of
vertices is the domain of the group, and edges cannot be added one by one,
but only as whole G-orbits.
(Alternatively, not all orbits of G are used as the vertex set, and then
adding a vertex would mean adding its G-orbit.)
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9136#comment:18>
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.
