You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@commons.apache.org by cs...@apache.org on 2012/02/28 23:34:48 UTC
svn commit: r1294872 -
/commons/sandbox/graph/trunk/src/site/xdoc/model/weights.xml
Author: cs
Date: Tue Feb 28 22:34:47 2012
New Revision: 1294872
URL: http://svn.apache.org/viewvc?rev=1294872&view=rev
Log:
typo in docs for weights
Modified:
commons/sandbox/graph/trunk/src/site/xdoc/model/weights.xml
Modified: commons/sandbox/graph/trunk/src/site/xdoc/model/weights.xml
URL: http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/site/xdoc/model/weights.xml?rev=1294872&r1=1294871&r2=1294872&view=diff
==============================================================================
--- commons/sandbox/graph/trunk/src/site/xdoc/model/weights.xml (original)
+++ commons/sandbox/graph/trunk/src/site/xdoc/model/weights.xml Tue Feb 28 22:34:47 2012
@@ -37,7 +37,7 @@
<section name="Dealing with weights">
<p>Let us assume that we have a <a href="../apidocs/org/apache/commons/graph/WeightedGraph.html">WeightedGraph</a>
whose edges are assigned weights of type Double.
- If we want to find the shortest path using Dijkstra's algorithm we will to pass an
+ If we want to find the shortest path using Dijkstra's algorithm we need an
implementation of the interface <a href="../apidocs/org/apache/commons/graph/weight/OrderedMonoid.html">OrderedMonoid</a>,
like the built-in <a href="../apidocs/org/apache/commons/graph/weight/primitive/DoubleWeightBaseOperations.html">DoubleWeightBaseOperations</a>:</p>