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/11 15:49:49 UTC
svn commit: r1134635 -
/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/Graph.java
Author: simonetripodi
Date: Sat Jun 11 13:49:49 2011
New Revision: 1134635
URL: http://svn.apache.org/viewvc?rev=1134635&view=rev
Log:
fixed Graph description in javadoc
Modified:
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/Graph.java
Modified: commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/Graph.java
URL: http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/Graph.java?rev=1134635&r1=1134634&r2=1134635&view=diff
==============================================================================
--- commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/Graph.java (original)
+++ commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/Graph.java Sat Jun 11 13:49:49 2011
@@ -15,16 +15,13 @@ package org.apache.commons.graph;
* See the License for the specific language governing permissions and
* limitations under the License.
*/
-/**
- * Graph This is the basic interface for a graph. G = { v, e }
- * getAdjacentVertices and getAdjacentEdges helps to define the behavior of
- * Edges.
- */
import java.util.Set;
/**
- * Description of the Interface
+ * A Graph data structure consists of a finite (and possibly mutable) set of ordered pairs,
+ * called {@link Edge}s or arcs, of certain entities called {@link Vertex} or node.
+ * As in mathematics, an {@link Edge} {@code (x,y)} is said to point or go from {@code x} to {@code y}.
*/
public interface Graph
{