#13785: Export a graph to a dictionary
---------------------------------+------------------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.6
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Nathann Cohen | Merged in:
Dependencies: #13784 | Stopgaps:
---------------------------------+------------------------------------------
Comment (by ncohen):
Well. I actually begin to write that after a few seconds over you
Suurballe algorithm. I read how it worked on wikipedia, and it looks like
you just need to change vertex weights and remove a few edges. This can
easily be done with dictionaries too `:-)`
Of course, if you need to run Dijkstra on the graph afterwards... `:-P`
But didn't you have a triangle_count code at Python-level which could use
this method already ?
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13785#comment:3>
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.
