[Perl-flat-commit-notify] SF.net SVN: perl-flat: [111] trunk/perl-flat/dev-scripts/ all-strings-no-cycles.pl

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

Revision: 111
          http://svn.sourceforge.net/perl-flat/?rev=111&view=rev
Author:   estrabd
Date:     2007-02-27 15:31:43 -0800 (Tue, 27 Feb 2007)

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


Modified Paths:
--------------
    trunk/perl-flat/dev-scripts/all-strings-no-cycles.pl

Modified: trunk/perl-flat/dev-scripts/all-strings-no-cycles.pl
===================================================================
--- trunk/perl-flat/dev-scripts/all-strings-no-cycles.pl	2007-02-27 20:50:51 UTC (rev 110)
+++ trunk/perl-flat/dev-scripts/all-strings-no-cycles.pl	2007-02-27 23:31:43 UTC (rev 111)
@@ -1,4 +1,15 @@
 #!/usr/bin/env perl -l
+
+#
+# To be implemented in the main module code soon 
+# (minus not the store/retrieve stuff); that is here for the convenience of testing
+#
+
+#
+# employs a recursive DFS based determination of all acyclic paths, which is 
+# pretty darn efficient
+#
+
 use strict;
 
 use lib qw(../lib);
@@ -49,18 +60,14 @@
 # this function finds all acyclic paths in the dfa for each symbol!!
 sub acyclic {                            
   my $startNode = shift;
-  $recurse_level++; # <- tracker
 # tree edge detection
   if (!exists($dflabel{$startNode})) {
     $dflabel{$startNode} = ++$lastDFLabel;  # the order inwhich this link was explored
-    $low{$startNode} = $lastDFLabel;
-    $backtracked{$startNode} = 0;           # marks this node as visited before - for cross edge detection
     foreach my $adjacent (keys(%{$nodes{$startNode}})) {
       if (!exists($dflabel{$adjacent})) {      # initial tree edge
         foreach my $symbol (@{$nodes{$startNode}{$adjacent}}) {
 	  push(@string,$symbol);
           acyclic($adjacent);
-          $backtracked{$adjacent}++;  # <- track backtracked nodes
 	  if ($low{$startNode} > $low{$adjacent}) {
 	    $low{$startNode} = $low{$adjacent};
 	  }	
@@ -75,6 +82,5 @@
   # remove startNode entry to facilitate acyclic path determination
   delete($dflabel{$startNode});
   $lastDFLabel--;
-  $recurse_level--; # <- tracker
   return;     
 };


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