Return-Path: 
 <commits-return-20241-apmail-commons-commits-archive=commons.apache.org@commons.apache.org>
X-Original-To: apmail-commons-commits-archive@minotaur.apache.org
Delivered-To: apmail-commons-commits-archive@minotaur.apache.org
Received: from mail.apache.org (hermes.apache.org [140.211.11.3])
	by minotaur.apache.org (Postfix) with SMTP id EF80C4CBE
	for <apmail-commons-commits-archive@minotaur.apache.org>;
 Tue,  5 Jul 2011 10:18:28 +0000 (UTC)
Received: (qmail 41550 invoked by uid 500); 5 Jul 2011 10:18:25 -0000
Delivered-To: apmail-commons-commits-archive@commons.apache.org
Received: (qmail 41251 invoked by uid 500); 5 Jul 2011 10:18:15 -0000
Mailing-List: contact commits-help@commons.apache.org; run by ezmlm
Precedence: bulk
List-Help: <mailto:commits-help@commons.apache.org>
List-Unsubscribe: <mailto:commits-unsubscribe@commons.apache.org>
List-Post: <mailto:commits@commons.apache.org>
List-Id: <commits.commons.apache.org>
Reply-To: dev@commons.apache.org
Delivered-To: mailing list commits@commons.apache.org
Received: (qmail 41243 invoked by uid 99); 5 Jul 2011 10:18:13 -0000
Received: from athena.apache.org (HELO athena.apache.org) (140.211.11.136)
    by apache.org (qpsmtpd/0.29) with ESMTP; Tue, 05 Jul 2011 10:18:13 +0000
X-ASF-Spam-Status: No, hits=-2000.0 required=5.0
	tests=ALL_TRUSTED
X-Spam-Check-By: apache.org
Received: from [140.211.11.4] (HELO eris.apache.org) (140.211.11.4)
    by apache.org (qpsmtpd/0.29) with ESMTP; Tue, 05 Jul 2011 10:18:11 +0000
Received: from eris.apache.org (localhost [127.0.0.1])
	by eris.apache.org (Postfix) with ESMTP id 70AB523889DA
	for <commits@commons.apache.org>; Tue,  5 Jul 2011 10:17:51 +0000 (UTC)
Content-Type: text/plain; charset="utf-8"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Subject: svn commit: r1142965 - in /commons/sandbox/graph/trunk/src:
 main/java/org/apache/commons/graph/model/BaseMutableGraph.java
 test/java/org/apache/commons/graph/visit/VisitTestCase.java
Date: Tue, 05 Jul 2011 10:17:51 -0000
To: commits@commons.apache.org
From: simonetripodi@apache.org
X-Mailer: svnmailer-1.0.8
Message-Id: <20110705101751.70AB523889DA@eris.apache.org>

Author: simonetripodi
Date: Tue Jul  5 10:17:51 2011
New Revision: 1142965

URL: http://svn.apache.org/viewvc?rev=1142965&view=rev
Log:
[SANDBOX-336] Duplicate Edge - TestCase submitted by Marco Speranza

Modified:
    commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/model/BaseMutableGraph.java
    commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java

Modified: commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/model/BaseMutableGraph.java
URL: http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/model/BaseMutableGraph.java?rev=1142965&r1=1142964&r2=1142965&view=diff
==============================================================================
--- commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/model/BaseMutableGraph.java (original)
+++ commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/model/BaseMutableGraph.java Tue Jul  5 10:17:51 2011
@@ -120,6 +120,11 @@ public abstract class BaseMutableGraph<V
         {
             throw new GraphException( "Tail Vertex '%s' not present in the Graph", tail );
         }
+        
+        if ( getEdge( head, tail ) != null )
+        {
+            throw new GraphException( "Edge %s is already present in the Graph", e );
+        }
 
         getAllEdges().add( e );
 

Modified: commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java
URL: http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java?rev=1142965&r1=1142964&r2=1142965&view=diff
==============================================================================
--- commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java (original)
+++ commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java Tue Jul  5 10:17:51 2011
@@ -143,24 +143,16 @@ public final class VisitTestCase
         input.addVertex( s );
 
         input.addEdge( s, new BaseLabeledEdge( "S <-> A" ), a );
-        input.addEdge( a, new BaseLabeledEdge( "A <-> S" ), s );
         input.addEdge( s, new BaseLabeledEdge( "S <-> B" ), b );
-        input.addEdge( b, new BaseLabeledEdge( "B <-> S" ), s );
 
         input.addEdge( a, new BaseLabeledEdge( "A <-> C" ), c );
-        input.addEdge( c, new BaseLabeledEdge( "C <-> A" ), a );
         input.addEdge( a, new BaseLabeledEdge( "A <-> D" ), d );
-        input.addEdge( d, new BaseLabeledEdge( "D <-> A" ), a );
 
         input.addEdge( b, new BaseLabeledEdge( "B <-> E" ), e );
-        input.addEdge( e, new BaseLabeledEdge( "E <-> B" ), b );
         input.addEdge( b, new BaseLabeledEdge( "B <-> F" ), f );
-        input.addEdge( f, new BaseLabeledEdge( "F <-> B" ), b );
 
         input.addEdge( e, new BaseLabeledEdge( "E <-> H" ), h );
-        input.addEdge( h, new BaseLabeledEdge( "H <-> E" ), e );
         input.addEdge( e, new BaseLabeledEdge( "E <-> G" ), g );
-        input.addEdge( g, new BaseLabeledEdge( "G <-> E" ), e );
 
         // expected node set