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. Thanks, David Dixon-Peugh -- To unsubscribe, e-mail: <mailto:[EMAIL PROTECTED]> For additional commands, e-mail: <mailto:[EMAIL PROTECTED]>
