Return-Path: X-Original-To: apmail-commons-dev-archive@www.apache.org Delivered-To: apmail-commons-dev-archive@www.apache.org Received: from mail.apache.org (hermes.apache.org [140.211.11.3]) by minotaur.apache.org (Postfix) with SMTP id D004B9DF0 for ; Fri, 3 Feb 2012 10:37:12 +0000 (UTC) Received: (qmail 61957 invoked by uid 500); 3 Feb 2012 10:37:10 -0000 Delivered-To: apmail-commons-dev-archive@commons.apache.org Received: (qmail 60744 invoked by uid 500); 3 Feb 2012 10:37:01 -0000 Mailing-List: contact dev-help@commons.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: "Commons Developers List" Delivered-To: mailing list dev@commons.apache.org Received: (qmail 60653 invoked by uid 99); 3 Feb 2012 10:36:53 -0000 Received: from nike.apache.org (HELO nike.apache.org) (192.87.106.230) by apache.org (qpsmtpd/0.29) with ESMTP; Fri, 03 Feb 2012 10:36:53 +0000 X-ASF-Spam-Status: No, hits=-0.7 required=5.0 tests=RCVD_IN_DNSWL_LOW,SPF_HELO_PASS,SPF_PASS X-Spam-Check-By: apache.org Received-SPF: pass (nike.apache.org: domain of squarcel@dia.uniroma3.it designates 193.205.219.56 as permitted sender) Received: from [193.205.219.56] (HELO mail3.dia.uniroma3.it) (193.205.219.56) by apache.org (qpsmtpd/0.29) with ESMTP; Fri, 03 Feb 2012 10:36:46 +0000 Received: from guest172.guestnet.ripe.net (guest172.guestnet.ripe.net [193.0.10.203]) (using TLSv1 with cipher DHE-RSA-CAMELLIA256-SHA (256/256 bits)) (No client certificate requested) (Authenticated sender: squarcel) by mail3.dia.uniroma3.it (Postfix) with ESMTPSA id 5846363E90 for ; Fri, 3 Feb 2012 11:36:25 +0100 (CET) Message-ID: <4F2BB8A7.7000705@dia.uniroma3.it> Date: Fri, 03 Feb 2012 11:36:23 +0100 From: Claudio Squarcella Organization: Roma Tre University User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.7; rv:9.0) Gecko/20111222 Thunderbird/9.0.1 MIME-Version: 1.0 To: dev@commons.apache.org Subject: Re: [graph] BST? References: In-Reply-To: Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit X-Virus-Checked: Checked by ClamAV on apache.org Hello, On 01/02/2012 17:39, Simone Tripodi wrote: > Hi Gary!!! :) > > I don't see any issue on adding the BST algorithms you need in > [graph], even if you have to reuse the minimum amount of codebase, > packages don't usually interact each other very much, unless some > DFS/BFS or shortest path is needed in other algo. > > I have the plan of adding KDTree searches as well. > > My personal vision of [graph] is realizing a graph-pedia of > graph-related algorithms implementation, so every addition is more > than welcome!!! I completely agree with Simone. I see [graph] as the right place not only for well-known algorithms but also for state-of-the-art results, where graphs are either "support structures" for computation or actual "main data structures" fitting the user domain. I would be thrilled to see more and more of these expansions in the future: e.g. the huge field of algorithms that rely on preprocessed or partially known graphs (see shortest paths for road networks & co). Looking forward, -- Claudio Squarcella PhD student at Roma Tre University E-mail address: squarcel@dia.uniroma3.it Phone: +39-06-57333215 Fax: +39-06-57333612 http://www.dia.uniroma3.it/~squarcel --------------------------------------------------------------------- To unsubscribe, e-mail: dev-unsubscribe@commons.apache.org For additional commands, e-mail: dev-help@commons.apache.org