add some '@reference' tags in javadoc

src/org/graphstream/algorithm/generator/FlowerSnarkGenerator.java

@@ -37,6 +37,10 @@ package org.graphstream.algorithm.generator;
  * 4. The flower snarks are non-planar and non-hamiltonian.
  * 
  * Source : <a href="http://en.wikipedia.org/wiki/Flower_snark">Wikipedia</a>
+ * 
+ * @reference Isaacs, R.
+ *            "Infinite Families of Nontrivial Trivalent Graphs Which Are Not Tait Colorable."
+ *            Amer. Math. Monthly 82, 221–239, 1975.
  */
 public class FlowerSnarkGenerator extends BaseGenerator {
 

src/org/graphstream/algorithm/generator/PreferentialAttachmentGenerator.java

@@ -33,15 +33,14 @@ package org.graphstream.algorithm.generator;
 import java.util.ArrayList;
 
 /**
- * Scale-free graph (tree) generator using the preferential attachment rule
- * as defined in the Barabási-Albert model.
+ * Scale-free graph (tree) generator using the preferential attachment rule as
+ * defined in the Barabási-Albert model.
  * 
  * <p>
  * This is a very simple graph generator that generates a tree using the
- * preferential attachment rule defined in the Barabási-Albert model: nodes
- * are generated one by one, and each time attached by an edge to another
- * node that has more chance to chosen if it already has lots of nodes
- * attached to it.
+ * preferential attachment rule defined in the Barabási-Albert model: nodes are
+ * generated one by one, and each time attached by an edge to another node that
+ * has more chance to chosen if it already has lots of nodes attached to it.
  * </p>
  * 
  * <p>
@@ -49,15 +48,9 @@ import java.util.ArrayList;
  * therefore generate trees of any size.
  * </p>
  * 
- * <p>This is taken from the paper :
- * 	<ul>
- *      <li>Emergence of scaling in random networks</li>
- * 		<li>Albert-László Barabási & Réka Albert</li>
- *      <li>Science 286: 509–512</li>
- *      <li>October 1999</li>
- *      <li>doi:10.1126/science.286.5439.509.</li>
- *  </ul>
- * </p>
+ * @reference Albert-László Barabási & Réka Albert
+ *            "Emergence of scaling in random networks". Science 286: 509–512.
+ *            October 1999. doi:10.1126/science.286.5439.509.
  * 
  * @since 20061128
  */

src/org/graphstream/algorithm/generator/RandomFixedDegreeDynamicGraphGenerator.java

@@ -90,7 +90,7 @@ package org.graphstream.algorithm.generator;
  * other properties), just by adding some constraints/characteristics on each
  * node?
  * 
- * @author Frédéric Guinand
+ * @author Frédéric Guinand
  * @since 20080616
  */
 public class RandomFixedDegreeDynamicGraphGenerator extends BaseGenerator {

src/org/graphstream/algorithm/generator/WattsStrogatzGenerator.java

@@ -4,22 +4,18 @@ import static java.lang.Math.*;
 
 /**
  * A generator following the small-world model of Watts and Strogatz.
- *
+ * 
  * <p>
  * This generator creates small-world graphs of arbitrary size.
  * </p>
  * 
  * <p>
- * This generator is based on the Watts-Strogatz model described in:
- * <ul>
- * 		<li>Watts, D.J. and Strogatz, S.H.</li>
- * 		<li>Collective dynamics of 'small-world' networks</li>
- * 		<li>Nature 393 (6684): 409–10</li>
- * 		<li>doi:10.1038/30918</li>
- * 		<li>PMID 9623998</li>
- * 		<li>1998</li>
- * </ul>
- * </p>
+ * This generator is based on the Watts-Strogatz model.
+ * 
+ * 
+ * @reference Watts, D.J. and Strogatz, S.H.
+ *            "Collective dynamics of 'small-world' networks". Nature 393
+ *            (6684): 409–10. doi:10.1038/30918. PMID 9623998. 1998.
  */
 public class WattsStrogatzGenerator extends BaseGenerator {
 	/** The number of nodes to generate. */