From d50e135c2354eb5fe05727278388e18e86ac57a3 Mon Sep 17 00:00:00 2001
From: pigne <yoann.pigne@gmail.com>
Date: Sun, 15 May 2011 16:43:07 +0200
Subject: [PATCH] Minor javadoc typos

---
 javadoc.xml                                                | 2 +-
 src/org/graphstream/algorithm/AStar.java                   | 7 ++-----
 src/org/graphstream/algorithm/coloring/WelshPowell.java    | 2 +-
 src/org/graphstream/algorithm/generator/BaseGenerator.java | 4 ++--
 4 files changed, 6 insertions(+), 9 deletions(-)

diff --git a/javadoc.xml b/javadoc.xml
index 47d90ec0..e1c8e20b 100644
--- a/javadoc.xml
+++ b/javadoc.xml
@@ -4,7 +4,7 @@
         <javadoc 
         	access="public" 
         	author="true" 
-        	classpath="../gs-core/lib/mbox2.jar:../gs-core/lib/util.jar:../gs-core/lib/pherd.jar:../gs-core/bin/" 
+        	classpath="../gs-core/lib/mbox2.jar:../gs-core/lib/util.jar:../gs-core/lib/pherd.jar:../gs-core/bin/:./lib/commons-math-2.1.jar" 
         	destdir="doc" 
         	doctitle="GraphStream 1.0 API" 
         	nodeprecated="false" 
diff --git a/src/org/graphstream/algorithm/AStar.java b/src/org/graphstream/algorithm/AStar.java
index b59c8a29..d961c120 100644
--- a/src/org/graphstream/algorithm/AStar.java
+++ b/src/org/graphstream/algorithm/AStar.java
@@ -83,7 +83,7 @@
  * <p>
  * The advantage of A* is that it can consider any cost function to drive the
  * search. You can create your own cost functions implementing the
- * {@link #Costs} interface.
+ * {@link org.graphstream.algorithm.AStar.Costs} interface.
  * </p>
  * <p>
  * You can also test the default "distance" cost function on a graph that has
@@ -151,10 +151,7 @@
  * 	}
  * }
  * </pre>
- * 
- * <p>
- * This algorithm uses the <i>std-algo-1.0</i> algorithm's standard.
- * </p>
+
  * 
  * @complexity The complexity of A* depends on the heuristic.
  * @author Antoine Dutot
diff --git a/src/org/graphstream/algorithm/coloring/WelshPowell.java b/src/org/graphstream/algorithm/coloring/WelshPowell.java
index 2ed1f5b5..34ad8390 100644
--- a/src/org/graphstream/algorithm/coloring/WelshPowell.java
+++ b/src/org/graphstream/algorithm/coloring/WelshPowell.java
@@ -72,7 +72,7 @@
  * <p>
  * After computation (using {@link #compute()}, the algorithm result for the
  * computation, the chromatic number, is accessible with the
- * {@link #getLastComputedResult()} method.  Colors (of "Integer" type) are stored in the graph as attributes (one for each node).
+ * {@link #getChromaticNumber()} method.  Colors (of "Integer" type) are stored in the graph as attributes (one for each node).
  * By default the attribute name is "WelshPowell.color", but you can optional choose the
  * attribute name.
  * </p>
diff --git a/src/org/graphstream/algorithm/generator/BaseGenerator.java b/src/org/graphstream/algorithm/generator/BaseGenerator.java
index acafde32..574162b6 100644
--- a/src/org/graphstream/algorithm/generator/BaseGenerator.java
+++ b/src/org/graphstream/algorithm/generator/BaseGenerator.java
@@ -252,7 +252,7 @@ public void setDirectedEdges(boolean directed, boolean randomly) {
 	 * 
 	 * @param name
 	 *            The attribute name.
-	 * @see #setNodeAttributesRange(float, float)
+	 * @see #setNodeAttributesRange(double, double)
 	 * @see #removeNodeAttribute(String)
 	 */
 	public void addNodeAttribute(String name) {
@@ -279,7 +279,7 @@ public void removeNodeAttribute(String name) {
 	 * 
 	 * @param name
 	 *            The attribute name.
-	 * @see #setEdgeAttributesRange(float, float)
+	 * @see #setEdgeAttributesRange(double, double)
 	 * @see #removeEdgeAttribute(String)
 	 */
 	public void addEdgeAttribute(String name) {