Skip to content

Commit

Permalink
Minor javadoc typos
Browse files Browse the repository at this point in the history
  • Loading branch information
pigne committed May 15, 2011
1 parent a5ad7dd commit d50e135
Show file tree
Hide file tree
Showing 4 changed files with 6 additions and 9 deletions.
2 changes: 1 addition & 1 deletion javadoc.xml
Expand Up @@ -4,7 +4,7 @@
<javadoc <javadoc
access="public" access="public"
author="true" 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" destdir="doc"
doctitle="GraphStream 1.0 API" doctitle="GraphStream 1.0 API"
nodeprecated="false" nodeprecated="false"
Expand Down
7 changes: 2 additions & 5 deletions src/org/graphstream/algorithm/AStar.java
Expand Up @@ -83,7 +83,7 @@
* <p> * <p>
* The advantage of A* is that it can consider any cost function to drive the * 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 * search. You can create your own cost functions implementing the
* {@link #Costs} interface. * {@link org.graphstream.algorithm.AStar.Costs} interface.
* </p> * </p>
* <p> * <p>
* You can also test the default "distance" cost function on a graph that has * You can also test the default "distance" cost function on a graph that has
Expand Down Expand Up @@ -151,10 +151,7 @@
* } * }
* } * }
* </pre> * </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. * @complexity The complexity of A* depends on the heuristic.
* @author Antoine Dutot * @author Antoine Dutot
Expand Down
2 changes: 1 addition & 1 deletion src/org/graphstream/algorithm/coloring/WelshPowell.java
Expand Up @@ -72,7 +72,7 @@
* <p> * <p>
* After computation (using {@link #compute()}, the algorithm result for the * After computation (using {@link #compute()}, the algorithm result for the
* computation, the chromatic number, is accessible with 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 * By default the attribute name is "WelshPowell.color", but you can optional choose the
* attribute name. * attribute name.
* </p> * </p>
Expand Down
4 changes: 2 additions & 2 deletions src/org/graphstream/algorithm/generator/BaseGenerator.java
Expand Up @@ -252,7 +252,7 @@ public void setDirectedEdges(boolean directed, boolean randomly) {
* *
* @param name * @param name
* The attribute name. * The attribute name.
* @see #setNodeAttributesRange(float, float) * @see #setNodeAttributesRange(double, double)
* @see #removeNodeAttribute(String) * @see #removeNodeAttribute(String)
*/ */
public void addNodeAttribute(String name) { public void addNodeAttribute(String name) {
Expand All @@ -279,7 +279,7 @@ public void removeNodeAttribute(String name) {
* *
* @param name * @param name
* The attribute name. * The attribute name.
* @see #setEdgeAttributesRange(float, float) * @see #setEdgeAttributesRange(double, double)
* @see #removeEdgeAttribute(String) * @see #removeEdgeAttribute(String)
*/ */
public void addEdgeAttribute(String name) { public void addEdgeAttribute(String name) {
Expand Down

0 comments on commit d50e135

Please sign in to comment.