[Perl-flat-commit-notify] SF.net SVN: perl-flat: [105] trunk/perl-flat/lib/FLAT/DFA.pm

[notifies s. of c. c. <per...@li...>]

Revision: 105
          http://svn.sourceforge.net/perl-flat/?rev=105&view=rev
Author:   estrabd
Date:     2007-02-23 14:42:52 -0800 (Fri, 23 Feb 2007)

Log Message:
-----------


Modified Paths:
--------------
    trunk/perl-flat/lib/FLAT/DFA.pm

Modified: trunk/perl-flat/lib/FLAT/DFA.pm
===================================================================
--- trunk/perl-flat/lib/FLAT/DFA.pm	2007-02-23 22:40:01 UTC (rev 104)
+++ trunk/perl-flat/lib/FLAT/DFA.pm	2007-02-23 22:42:52 UTC (rev 105)
@@ -194,8 +194,8 @@
       $low{$startNode} = $lastDFLabel;
       $backtracked{$startNode} = 0;           # marks this node as visited before - for cross edge detection
       foreach my $adjacent (keys(%{$nodes{$startNode}})) {
-        printf("%s",$nodes{$startNode}{$adjacent}->[0]);
-	print "" if ($self->is_accepting($adjacent));
+        #printf("%s",$nodes{$startNode}{$adjacent}->[0]);
+	#print "" if ($self->is_accepting($adjacent));
 	if (!exists($dflabel{$adjacent})) {      # initial tree edge
 #           print "tree edge! $startNode -> $adjacent"; # for testing only
 	} elsif (-1 == ($dflabel{$adjacent} - $dflabel{$startNode})){ # detects child visiting a parent
@@ -208,6 +208,7 @@
         $REC->($adjacent);
         # on back tracking, do the following
         $backtracked{$adjacent}++;  # <- track backtracked nodes
+	print "$backtracked{$adjacent}";
         # update LOW of $startNode
 	if ($low{$startNode} > $low{$adjacent}) {
 	  $low{$startNode} = $low{$adjacent};


This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.