Examples of eas.math.fundamentalAlgorithms.graphBased.algorithms.tree234.Tree234Impl

Package eas.math.fundamentalAlgorithms.graphBased.algorithms.tree234

Examples of eas.math.fundamentalAlgorithms.graphBased.algorithms.tree234.Tree234Impl

eas.math.fundamentalAlgorithms.graphBased.algorithms.tree234.Tree234
This is the actual implementation of the 2-3-4 tree in Java. It uses top down partitioning in splitting each 4-node that is traversed while inserting a new key in the tree. The tree stores only keys that have no idea associated with them.
For the time being we allow duplicates @author marlon.braun @param < Key> The elements that are inserted in the tree

        list.add(new Huffman());
        list.add(new PlainDOT());
        list.add(new PatTree());
        list.add(new MARB());
        list.add(new RedBlackTree());
        list.add(new Tree234());
        list.add(new LaTeX());
        list.add(new Calc());
        list.add(new PlainGNUPlot());
        new GraphBasedWindow(params, list);
    }

View Full Code Here

TOP

Related Classes of eas.math.fundamentalAlgorithms.graphBased.algorithms.tree234.Tree234Impl

eas.math.fundamentalAlgorithms.graphBased.pdfProcessors.GraphViz

eas.math.fundamentalAlgorithms.graphBased.plugin.GraphBasedPlugin

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.