Well, the library itself is partially the goal, but the real goal is the GUI behind the library. I've developed an interface that couples with the data structures and algorithms and "visualizes" them up on the screen using graphviz. This process is no where near complete, and the GUI is still quite awful, but we have some good proof of concepts done, and a large library to work with now.
B+ Tree's are in development, as well as Thin & Thick Heaps. I just got Fibonacci Heaps up and running, and boy do they look fantastic! It's quite inspiring to see a 400 node Fibonacci Heap working in real time. Cheers On Jul 13, 3:00 am, billjeff <[EMAIL PROTECTED]> wrote: > So you wanna to implement a algorithm lib to help people to learn how > some algorithm work? That would be great. Some network flow algorithm > is not easy to understand, except with the help of visualization. Some > graph algorithms like convex hull, finding the max distance in a set > of 2d-points( Rotating Calipers ), Data structures like RB Tree, B+ > Tree, Suffix Array contruction etc. And there are some visualization > examples for some algorithms like Rotating Calipers, which may be > useful for you. > > On Jun 30, 10:34 pm, Wes Jossey <[EMAIL PROTECTED]> wrote: > > > Morning Everyone: > > > I'm currently creating a Java library that contains a collection of > > interfaces, abstract classes, and fully implemented versions of an > > assortment of data-structures and algorithms. The library is going to > > be used in conjunction with a program I'm writing, and its primary > > purpose is to be used by undergraduate CS majors. > > > Here is a list of the currently accumulated structures and algorithms: > > > Ford Fulkerson > > Nearest Neighbor > > 2OPT > > Binary Heap > > Binomial Heap > > Red-Black Trees > > Binary Search Trees > > Linked Lists > > Queue > > Prim's > > Kruskel's > > Min-Cut Max-Flow > > Stacks > > Quicksort > > Bubblesort > > Merge-sort > > Insertion-sort > > Disjoint Sets > > > The algorithms and data structures are implemented using interfaces > > and java generics to promote type safe development, as well as ease of > > use in injecting personal code by users and students. Abstract > > classes have been partially implemented as well so as to allow for > > quicker development when re-using code will save time. > > > I'm interested to hear what you all might find as useful algorithms to > > see working visually. What algorithms did you have particular trouble > > with in college (if you attended). Anything you wish you would have > > seen but you didn't? > > > Thanks for the feedback! > > > Wes Jossey > > --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
