#4854: represent paths as lists of edges
--------------------------+-------------------------------------------------
Reporter: rlm | Owner: rlm
Type: defect | Status: new
Priority: major | Milestone: sage-3.4
Component: graph theory | Keywords:
--------------------------+-------------------------------------------------
From sage-devel:
{{{
While trying to model deterministic finite automata over Sage
(multi-)graphs,
I've run into the following: paths are represented as lists of vertices,
regardless
of edges. Superficial investigation shows that both sage.graph and
networkx are somewhat grounded on this notion of path.
But! For finite automata and other word-accepting machines to be correctly
represented paths should be considered as sequences of labeled edges, not
vertices, as far as two vertices may be connected by differently labeled
edges, and that is essential.
}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/4854>
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
-~----------~----~----~----~------~----~------~--~---
