You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@commons.apache.org by si...@apache.org on 2011/06/12 00:25:41 UTC
svn commit: r1134801 -
/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/domain/basic/DirectedGraphImpl.java
Author: simonetripodi
Date: Sat Jun 11 22:25:41 2011
New Revision: 1134801
URL: http://svn.apache.org/viewvc?rev=1134801&view=rev
Log:
minor code format
Modified:
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/domain/basic/DirectedGraphImpl.java
Modified: commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/domain/basic/DirectedGraphImpl.java
URL: http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/domain/basic/DirectedGraphImpl.java?rev=1134801&r1=1134800&r2=1134801&view=diff
==============================================================================
--- commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/domain/basic/DirectedGraphImpl.java (original)
+++ commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/domain/basic/DirectedGraphImpl.java Sat Jun 11 22:25:41 2011
@@ -47,6 +47,7 @@ import org.apache.commons.graph.contract
public class DirectedGraphImpl<V extends Vertex, WE extends WeightedEdge>
implements DirectedGraph<V, WE>, WeightedGraph<V, WE>, MutableDirectedGraph<V, WE>, InvocationHandler
{
+
private V root = null;
private final Set<V> vertices = new HashSet<V>();
@@ -55,13 +56,13 @@ public class DirectedGraphImpl<V extends
private final List<Contract> contracts = new ArrayList<Contract>();
- private final Map<V, Set<WE>> inbound = new HashMap<V, Set<WE>>();// VERTEX X SET( EDGE )
+ private final Map<V, Set<WE>> inbound = new HashMap<V, Set<WE>>(); // VERTEX X SET( EDGE )
- private final Map<V, Set<WE>> outbound = new HashMap<V, Set<WE>>();// - " " -
+ private final Map<V, Set<WE>> outbound = new HashMap<V, Set<WE>>(); // VERTEX X SET( EDGE )
- private final Map<WE, V> edgeSource = new HashMap<WE, V>();// EDGE X VERTEX
+ private final Map<WE, V> edgeSource = new HashMap<WE, V>(); // EDGE X VERTEX
- private final Map<WE, V> edgeTarget = new HashMap<WE, V>();// EDGE X TARGET
+ private final Map<WE, V> edgeTarget = new HashMap<WE, V>(); // EDGE X TARGET
private final Map<WE, Number> edgeWeights = new HashMap<WE, Number>();// EDGE X WEIGHT
@@ -94,8 +95,7 @@ public class DirectedGraphImpl<V extends
if ( dg instanceof WeightedGraph )
{
- @SuppressWarnings( "unchecked" )
- // it is a DirectedGraph<V, WE>
+ @SuppressWarnings( "unchecked" ) // it is a DirectedGraph<V, WE>
WeightedGraph<V, WE> weightedGraph = (WeightedGraph<V, WE>) dg;
setWeight( edge, weightedGraph.getWeight( edge ) );
}