Return-Path: Delivered-To: apmail-jakarta-commons-dev-archive@apache.org Received: (qmail 29408 invoked from network); 17 Dec 2001 01:03:34 -0000 Received: from unknown (HELO nagoya.betaversion.org) (192.18.49.131) by daedalus.apache.org with SMTP; 17 Dec 2001 01:03:34 -0000 Received: (qmail 3379 invoked by uid 97); 17 Dec 2001 01:03:40 -0000 Delivered-To: qmlist-jakarta-archive-commons-dev@jakarta.apache.org Received: (qmail 3339 invoked by uid 97); 17 Dec 2001 01:03:39 -0000 Mailing-List: contact commons-dev-help@jakarta.apache.org; run by ezmlm Precedence: bulk List-Unsubscribe: List-Subscribe: List-Help: List-Post: List-Id: "Jakarta Commons Developers List" Reply-To: "Jakarta Commons Developers List" Delivered-To: mailing list commons-dev@jakarta.apache.org Received: (qmail 3328 invoked from network); 17 Dec 2001 01:03:39 -0000 Message-ID: <3C1D4564.3090903@mindspring.com> Date: Sun, 16 Dec 2001 20:07:48 -0500 From: David Dixon-Peugh User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:0.9.2) Gecko/20010726 Netscape6/6.1 X-Accept-Language: en-us MIME-Version: 1.0 To: commons-dev@jakarta.apache.org Subject: Suggestions for Graph package in Sandbox Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit X-Spam-Rating: daedalus.apache.org 1.6.2 0/1000/N X-Spam-Rating: daedalus.apache.org 1.6.2 0/1000/N 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: For additional commands, e-mail: