Hi Jason,
Good point! Networkx comes quite close. I agree with the distinction
between graphs and algorithms as in networkx. Graphs objects just for
storage of the graph data.
But for algorithms, I have different picture which is closer to how it
is in sage... e.g. no segmentation (hence also the tab completion is
kept functional)...
(I have searched and found that there has been discussion on how much
networkx will be adapted in sage - and it seems that there is some issue
with the license... right? I also read the sage-devel thread "graph
theory: refactor implementation of spanning tree algorithms" which give
me some impression...)
Thank you!
Birk
--
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http://www.sagemath.org
