[DL-Learner SVN] SF.net SVN: dl-learner: [597] trunk/src/dl-learner/org/dllearner/algorithms /refinement/ROLearner.java

[<jen...@us...>]

Revision: 597
          http://dl-learner.svn.sourceforge.net/dl-learner/?rev=597&view=rev
Author:   jenslehmann
Date:     2008-02-18 02:32:27 -0800 (Mon, 18 Feb 2008)

Log Message:
-----------
added getStartNode method such that the root of the search tree can be obtained

Modified Paths:
--------------
    trunk/src/dl-learner/org/dllearner/algorithms/refinement/ROLearner.java

Modified: trunk/src/dl-learner/org/dllearner/algorithms/refinement/ROLearner.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/algorithms/refinement/ROLearner.java	2008-02-17 23:38:43 UTC (rev 596)
+++ trunk/src/dl-learner/org/dllearner/algorithms/refinement/ROLearner.java	2008-02-18 10:32:27 UTC (rev 597)
@@ -119,6 +119,11 @@
 	// detect whether a new best node has been found since the last time
 	// statistics were printed)
 	private Node previousBestNode;
+	
+	// record start node such that other applications can
+	// get information about the search tree
+	private Node startNode;
+	
 	// boolean createTreeString = false;
 	// String searchTree = new String();
 	TreeSet<Node> expandedNodes = new TreeSet<Node>(nodeComparatorStable);
@@ -348,6 +353,7 @@
 		// der Länge 1 untersucht wurden
 		candidates.add(topNode);
 		candidatesStable.add(topNode);
+		startNode = topNode;
 		// Abbruchvariable => beachten, dass bereits TOP eine Lösung sein kann
 		solutionFound = (coveredNegativeExamples == 0);
 		solutions = new LinkedList<Description>();
@@ -987,4 +993,11 @@
 		stop = true;
 	}
 
+	/**
+	 * @return the startNode
+	 */
+	public Node getStartNode() {
+		return startNode;
+	}
+
 }


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