On 12/16/01 8:07 PM, "David Dixon-Peugh" <[EMAIL PROTECTED]> wrote:
> > Good Evening, > > I've been working with the Graph package in the Commons Sandbox, > and I have a couple of suggestions. > > #1 - Separate DirectedGraph and UndirectedGraph classes which > inherit from the Graph class. > > This would basically allow us to write algorithms which require > a specific type of Graph. (What does a Topo sort do if you have > an undirected graph?) > > #2 - Advice on how to implement algorithms within the package. > > I'm writing some algorithms which would be great additions to the > package (Minimum Spanning Forest, Topological Sort, Back Edge > Finder, etc.) > > Following the Visitor pattern works for some algorithms (like the > Topo sort and Back edge finder), but it doesn't work as nicely for > something like the Minimum Spanning Forest. > > > Aside from these, I think the Graph package is a great idea, and > am willing to contribute what I can to make it work. Great! If you have any patches or tests just send them this way and I'll apply them. Thanks for the interest! > Thanks, > > David Dixon-Peugh > > > -- > To unsubscribe, e-mail: <mailto:[EMAIL PROTECTED]> > For additional commands, e-mail: <mailto:[EMAIL PROTECTED]> -- jvz. Jason van Zyl http://tambora.zenplex.org http://jakarta.apache.org/turbine http://jakarta.apache.org/velocity http://jakarta.apache.org/alexandria http://jakarta.apache.org/commons -- To unsubscribe, e-mail: <mailto:[EMAIL PROTECTED]> For additional commands, e-mail: <mailto:[EMAIL PROTECTED]>
