#6085: [with patch, not ready] Finish full implementation of c_graphs
--------------------------+-------------------------------------------------
Reporter: rlm | Owner: rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.0.1
Component: graph theory | Keywords:
--------------------------+-------------------------------------------------
Comment(by rlm):
Some notes for posterity:
{{{
1. hashable vertices
- have a list to go from an int to a label
- a dict will go the other way
- a stack will keep track of "unused" vertices leftover from deletion
- these will be listed as "None" in the list
2. arbitrary edge labels
- this will simply be a dict, going from ints to objects
- since edge labels need not be hashable, we will need to do a search
when trying to find the int for a label, but if we fail to find one,
we will have a new int label for this new edge label
3. pickling
- this will be little more than a sparse6 string
}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6085#comment:1>
Sage <http://sagemath.org/>
Sage - Open Source Mathematical Software: Building the Car Instead of
Reinventing the Wheel
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
