> ... paths should be considered as sequences of labeled edges, not > vertices, as far as two vertices may be connected by differently labeled > edges ...
I completely agree! Much of this functionality was written as a wrapper for NetworkX a while ago, and hasn't been revisited since. I would happily review any patch that did this, and I've made it trac ticket #4854. > Generally speaking, we plan to represent finite, pushdown and a new > generalization of pushdown automata (D-Graphs) over Sage graphs, > leveraging existing machinery. Is there any other machinery you find missing or in need of attention? --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to sage-devel-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
