Hi,
For these kind of questions, please use sage-support (an other google
groups) or better http://ask.sagemath.org (as it may be useful for
other users).
To create a digraph, you need to use
sage: G = DiGraph({'b': ['a']})
sage: G.edges()
And you have methods G.outgoing_edges() and G.incoming_edges().
Vincent
2014-10-20 17:11 UTC, Jori Mantysalo <[email protected]>:
> When I hit this, I was making a code for posets, but this is actually more
> general question. Shortly, do (di)graphs have some kind of order of
> vertices? To start, will
>
> Graph({'b':['a']}).vertices()
>
> always print ['a', 'b'], not ['b', 'a']? How about directed graphs? What
> about adding or deleting vertex (or edge), can it change order of
> remaining vertices? How about list of incoming or outgoing list?
>
> Is there even some kind of general rule about this kind of thing at Sage?
>
> --
> Jori Mäntysalo
>
> --
> You received this message because you are subscribed to the Google Groups
> "sage-devel" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to [email protected].
> To post to this group, send email to [email protected].
> Visit this group at http://groups.google.com/group/sage-devel.
> For more options, visit https://groups.google.com/d/optout.
>
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-devel.
For more options, visit https://groups.google.com/d/optout.
