Home >> All >> com >> phoenixst >> plexus >> [ examples Javadoc ]

• com.phoenixst.plexus.examples: Javadoc index of package com.phoenixst.plexus.examples.


Package Samples:

• com.phoenixst.plexus.examples

Classes:

• IntegerNodeGraph: An unmodifiable graph where the nodes are Integers from zero to a specified number (exclusive) and the edges do not contain user-defined objects. This is mainly useful for implementing special-case graphs that do not actually need to explicitly store their structure. By default, this implementation is undirected and simple. To fully implement an undirected simple extension of this class, the programmer must provide implementations for the following methods: getEdge( tail, head ) 55 edgeIterator() 55 traverser( node ) 55 In addition, it is recommended that the programmer override the following methods ...
• Prism: An m x n prism, where m is the size of the cycle and n is the size of the path. This graph is pretty much a cylinder, but takes its name from the fact that if the cycle is of size 3, then it looks like a prism.
• NodeOffsetTransformer: A com.phoenixst.plexus.Graph which wraps another, adding the specified offset to the underlying graph's nodes, which must be Integers .
• Cycle: A Graph containing a set of Integer nodes connected by a path of edges from the first node to the last one, and then back to the first, making a cycle.
• DefaultGraphExamplesTest: A com.phoenixst.plexus.DefaultGraph tester for copies of examples graphs, at least the immutable operations.
• CompleteBipartiteGraphTest: A CompleteBipartiteGraph tester.
• CompleteGraphTest: A CompleteGraph tester.
• PetersenGraphTest: A PetersenGraph tester.
• CompleteTreeTest: A CompleteTree tester.
• ToroidalMeshTest: A ToroidalMesh tester.
• EmptyGraphTest: An EmptyGraph tester.
• Path: A Graph containing a set of Integer nodes connected by a path of edges from the first node to the last one.
• PlanarMeshTest: A PlanarMesh tester.
• CycleTest: A Cycle tester.
• PrismTest: A Prism tester.
• WheelTest: A Wheel tester.
• PathTest: A Path tester.
• StarTest: A Star tester.
• CompleteGraph: A Graph containing a set of Integer nodes where there is an edge between every pair of nodes.
• EmptyGraph: A Graph containing a set of Integer nodes and no edges.
• Wheel: A wheel graph with one central node and n outer nodes.
• Star: A star graph with one central node and n outer nodes.
• CompleteTree: A Graph which is a complete tree.
• AllTests: Test suite for all tests in this package.

Home | Contact Us | Privacy Policy | Terms of Service