Hi,
I need to construct a BFS order (rooted in v0 for example) from a graph,
Then, I need to obtain the vertex at distance min{r, d(v,v0)} from v on the
path of the BFS-tree from v to v0.
I'd like to know if I have to build myself the tree from the list obtained
by the function breadth_first_search of Sage or if there is an easiest way
to get this vertex.
Thanks,
François
--
You received this message because you are subscribed to the Google Groups
"sage-support" 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-support.
For more options, visit https://groups.google.com/d/optout.
