27 Aug
2014
27 Aug
'14
1:25 a.m.
On 25 August 2014 18:48, Alexander Lauser <alxlaus@gmx.de> wrote:
With that you can simulate traversal events (or what I think you want them to be) really easily: Implement the traversal-handler as an internal member function and call it at whenever a vertex is discoved and whenever a tree-edge is finished (with the source of the edge as parameter). What do you think?
Yes, that would work.
As your traversal events are easily simulated by that and IMO do not possess a canonical semantics for undirected or non-tree graphs, I don't think it wise to load the interface with them.
So does what you're suggesting generalize to non-tree graphs? I believe it does. If so, it sounds good. Jeremy