in progress

diff --git a/forester/java/src/org/forester/test/examples/Example3.java b/forester/java/src/org/forester/test/examples/Example3.java
new file mode 100644 (file)
index 0000000..d5c2bb6
--- /dev/null
+++ b/forester/java/src/org/forester/test/examples/Example3.java
@@ -0,0 +1,72 @@
+// $Id:
+//
+// forester -- software libraries and applications
+// for evolutionary biology research and applications.
+//
+// Copyright (C) 2008-2011 Christian M. Zmasek
+// Copyright (C) 2008-2011 Burnham Institute for Medical Research
+// All rights reserved
+//
+// This library is free software; you can redistribute it and/or
+// modify it under the terms of the GNU Lesser General Public
+// License as published by the Free Software Foundation; either
+// version 2.1 of the License, or (at your option) any later version.
+//
+// This library is distributed in the hope that it will be useful,
+// but WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+// Lesser General Public License for more details.
+//
+// You should have received a copy of the GNU Lesser General Public
+// License along with this library; if not, write to the Free Software
+// Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
+//
+// Contact: phylosoft @ gmail . com
+// WWW: www.phylosoft.org/forester
+
+package org.forester.test.examples;
+
+import org.forester.phylogeny.Phylogeny;
+import org.forester.phylogeny.PhylogenyNode;
+import org.forester.phylogeny.iterators.PhylogenyNodeIterator;
+
+public class Example3 {
+
+    public static void main( final String[] args ) {
+        // Creating a new rooted tree with four external nodes.
+        final Phylogeny phy = new Phylogeny();
+        final PhylogenyNode root = new PhylogenyNode();
+        final PhylogenyNode d1 = new PhylogenyNode();
+        final PhylogenyNode d2 = new PhylogenyNode();
+        final PhylogenyNode d11 = new PhylogenyNode();
+        final PhylogenyNode d12 = new PhylogenyNode();
+        root.setName( "root" );
+        d1.setName( "1" );
+        d2.setName( "2" );
+        d11.setName( "1-1" );
+        d12.setName( "1-2" );
+        root.addAsChild( d1 );
+        root.addAsChild( d2 );
+        d2.addAsChild( d11 );
+        d2.addAsChild( d12 );
+        phy.setRoot( root );
+        phy.setRooted( true );
+        // Using a variety of iterators to visit the nodes of the newly created tree.
+        System.out.println( "post-order:" );
+        for( final PhylogenyNodeIterator it = phy.iteratorPostorder(); it.hasNext(); ) {
+            System.out.println( it.next().getName() );
+        }
+        System.out.println( "pre-order:" );
+        for( final PhylogenyNodeIterator it = phy.iteratorPreorder(); it.hasNext(); ) {
+            System.out.println( it.next().getName() );
+        }
+        System.out.println( "level-order:" );
+        for( final PhylogenyNodeIterator it = phy.iteratorLevelOrder(); it.hasNext(); ) {
+            System.out.println( it.next().getName() );
+        }
+        System.out.println( "external nodes only:" );
+        for( final PhylogenyNodeIterator it = phy.iteratorExternalForward(); it.hasNext(); ) {
+            System.out.println( it.next().getName() );
+        }
+    }
+}