Java Doc for DepthFirstIteratorTest.java in » GIS » GeoTools-2.4.1 » org » geotools » graph » traverse » standard » Java Source Code / Java DocumentationJava Source Code and Java Documentation

Java Source Code / Java Documentation

1.	6.0 JDK Core
2.	6.0 JDK Modules
3.	6.0 JDK Modules com.sun
4.	6.0 JDK Modules com.sun.java
5.	6.0 JDK Modules sun
6.	6.0 JDK Platform
7.	Ajax
8.	Apache Harmony Java SE
9.	Aspect oriented
10.	Authentication Authorization
11.	Blogger System
12.	Build
13.	Byte Code
14.	Cache
15.	Chart
16.	Chat
17.	Code Analyzer
18.	Collaboration
19.	Content Management System
20.	Database Client
21.	Database DBMS
22.	Database JDBC Connection Pool
23.	Database ORM
24.	Development
25.	EJB Server geronimo
26.	EJB Server GlassFish
27.	EJB Server JBoss 4.2.1
28.	EJB Server resin 3.1.5
29.	ERP CRM Financial
30.	ESB
31.	Forum
32.	GIS
33.	Graphic Library
34.	Groupware
35.	HTML Parser
36.	IDE
37.	IDE Eclipse
38.	IDE Netbeans
39.	Installer
40.	Internationalization Localization
41.	Inversion of Control
42.	Issue Tracking
43.	J2EE
44.	JBoss
45.	JMS
46.	JMX
47.	Library
48.	Mail Clients
49.	Net
50.	Parser
51.	PDF
52.	Portal
53.	Profiler
54.	Project Management
55.	Report
56.	RSS RDF
57.	Rule Engine
58.	Science
59.	Scripting
60.	Search Engine
61.	Security
62.	Sevlet Container
63.	Source Control
64.	Swing Library
65.	Template Engine
66.	Test Coverage
67.	Testing
68.	UML
69.	Web Crawler
70.	Web Framework
71.	Web Mail
72.	Web Server
73.	Web Services
74.	Web Services apache cxf 2.0.1
75.	Web Services AXIS2
76.	Wiki Engine
77.	Workflow Engines
78.	XML
79.	XML UI

Java

Java Tutorial

Illustrator Tutorials

GIMP Tutorials

C# / C Sharp

C# / CSharp Tutorial

C# / CSharp Open Source

SQL Server / T-SQL Tutorial

Oracle PL / SQL

Oracle PL/SQL Tutorial

Flash / Flex / ActionScript

VBA / Excel / Access / Word

XML

XML Tutorial

Microsoft Office PowerPoint 2007 Tutorial

Microsoft Office Excel 2007 Tutorial

Microsoft Office Word 2007 Tutorial

Java Source Code / Java Documentation » GIS » GeoTools 2.4.1 » org.geotools.graph.traverse.standard

Source Cross Reference

Class Diagram

Java Document (Java Doc)

org.geotools.graph.traverse.standard .DepthFirstIteratorTest

All known Subclasses:   org.geotools.graph.traverse.standard .DirectedDepthFirstIteratorTest,
DepthFirstIteratorTest
public class DepthFirstIteratorTest extends TestCase (Code)

Constructor Summary
public DepthFirstIteratorTest(String name)


Method Summary
protected GraphBuilder builder()

protected GraphBuilder createBuilder()

protected DepthFirstIterator createIterator()

protected void setUp()

public void test_0()
     Create a simple graph which has no bifurcations and do a normal traversal.
public void test_1()
     Create a simple graph which has no bifurcations and do a traversal suspending at some intermediate node.
public void test_2()
     Create a simple graph which has no bifurcations and do a kill branch at some intermediate node.
public void test_3()
     Create a balanced binary tree and do a normal traversal starting at root.
public void test_4()
     Create a balanced binary tree and do a traversal starting at root and suspending at the first node seen that is not the root, (should be left child).
public void test_5()
     Create a balanced binary tree and do a traversal starting at root and kill branch at the first node seen that is not the root, (should be left child).
public void test_6()
     Create a graph that contains a cycle and do a full traversal.

Expected: 1.

Constructor Detail
DepthFirstIteratorTest
public DepthFirstIteratorTest(String name)(Code)

Method Detail
builder
protected GraphBuilder builder()(Code)

createBuilder
protected GraphBuilder createBuilder()(Code)

createIterator
protected DepthFirstIterator createIterator()(Code)

setUp
protected void setUp() throws Exception(Code)

test_0
public void test_0()(Code)
Create a simple graph which has no bifurcations and do a normal traversal.

Expected: 1. Every node should be visited. 2. Nodes should be visited in order.

test_1
public void test_1()(Code)
Create a simple graph which has no bifurcations and do a traversal suspending at some intermediate node. Then continue traversal. Expected: After suspend: 1. Every node of with an id greater than the id of the suspending node should not be visited. After continue: 1. First node visited after continue should have id = id + suspend node + 1 2. Every node should be visited.

test_2
public void test_2()(Code)
Create a simple graph which has no bifurcations and do a kill branch at some intermediate node. Then continue the traversal. Expected: After kill: 1. Every node of with an id greater than the id of the killing node should not be visited. After continue: 2. No more nodes should be visited.

test_3
public void test_3()(Code)
Create a balanced binary tree and do a normal traversal starting at root.

Expected: 1. Every node should be visited. 2. For each node, every node in one of its two subtrees should have been visited before every node in the other subtree.

test_4
public void test_4()(Code)
Create a balanced binary tree and do a traversal starting at root and suspending at the first node seen that is not the root, (should be left child). Then continue the traversal.

Expected: After suspend: 1. Only root and first non root should be visited. After continue: 1. First node visited should be child of suspending node. 2. Every node should be visited.

test_5
public void test_5()(Code)
Create a balanced binary tree and do a traversal starting at root and kill branch at the first node seen that is not the root, (should be left child). Then continue the traversal.

Expected: After kill: 1. All nodes should be visited except for sub nodes of first child of root visited. (the kill node) After continue: 1. Same as after kill.

test_6
public void test_6()(Code)
Create a graph that contains a cycle and do a full traversal.

Expected: 1. All nodes visited.

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.