From: notifies s. of c. c. <per...@li...> - 2007-05-04 21:20:47
|
Revision: 118 http://svn.sourceforge.net/perl-flat/?rev=118&view=rev Author: estrabd Date: 2007-05-04 14:20:47 -0700 (Fri, 04 May 2007) Log Message: ----------- Modified Paths: -------------- trunk/perl-flat/dev-scripts/explode.pl Modified: trunk/perl-flat/dev-scripts/explode.pl =================================================================== --- trunk/perl-flat/dev-scripts/explode.pl 2007-03-05 23:01:08 UTC (rev 117) +++ trunk/perl-flat/dev-scripts/explode.pl 2007-05-04 21:20:47 UTC (rev 118) @@ -42,12 +42,10 @@ &acyclic($dfa->get_starting(),$dfa->get_accepting()); #<-- accepts start node and set of possible goals - # Given a start node and a set of valid @goal nodes, we can find an acyclic path; based # how one composes the @goal set determines its behavior. What matters first and foremost # is that we return to a node on the parent acyclic that is assumed to at some point to get a final node - sub acyclic { my $startNode = shift; my @goalNodes = @_; This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |