Hi,
Whenever I had to develop an FSM in the past, I chose either of the
following paths:
- For small and simple machines I often resorted to the IMHO ugly nested
switch-case approach.
- For bigger and more complex machines, I often used a code-generation
approach because I failed to find a
It appears that depth_first_visit does not invoke the start_vertex
visitors as the depth_first_search routines do. Here is a patch
to correct that.
Jeffrey
*** depth_first_search.hpp.0Tue May 27 00:22:48 2003
--- depth_first_search.hpp
Alexander Terekhov wrote:
Russell Hind wrote:
Trevor Taylor wrote:
Who? Me?
I think Peter meant Alexander
I got the message. I'll post refcountthread_safety,
typename integer_t once I'll have some time for it. It won't include
atomic implementation(s), however. ;-)
Looks like my name didn't get added to my post. :(
Bruce Barr
___
Unsubscribe other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
Hi Andreas,
[...]
An attempt at an easy-to-use FSM library that supports
well-maintainable and code-expressive machines of almost any size and
does not require a code generator can be found in the fsm directories
in the boost-sandbox and here: