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 2012/06/28 13:54:03 UTC
svn commit: r1354958 -
/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java
Author: simonetripodi
Date: Thu Jun 28 11:54:02 2012
New Revision: 1354958
URL: http://svn.apache.org/viewvc?rev=1354958&view=rev
Log:
s/<-/←/ for a better javadoc rendering
Modified:
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java
Modified: commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java
URL: http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java?rev=1354958&r1=1354957&r2=1354958&view=diff
==============================================================================
--- commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java (original)
+++ commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java Thu Jun 28 11:54:02 2012
@@ -466,8 +466,8 @@ public final class FibonacciHeap<E>
* <pre>CUT(H,x,y)
* 1 remove x from the child list of y, decrementing degree[y]
* 2 add x to the root list of H
- * 3 p[x] <- NIL
- * 4 mark[x] <- FALSE</pre>
+ * 3 p[x] ← NIL
+ * 4 mark[x] ← FALSE</pre>
*
* @param x the node has to be removed from {@code y} children
* @param y the node has to be updated
@@ -493,10 +493,10 @@ public final class FibonacciHeap<E>
* Implements the {@code CASCADING-CUT(H,y)} function.
*
* <pre>CASCADING-CUT(H,y)
- * 1 z <- p[y]
+ * 1 z ← p[y]
* 2 if z ≠ NIL
* 3 then if mark[y] = FALSE
- * 4 then mark[y] <- TRUE
+ * 4 then mark[y] ← TRUE
* 5 else CUT(H,y,z)
* 6 CASCADING-CUT(H,z)</pre>
*
@@ -541,16 +541,16 @@ public final class FibonacciHeap<E>
* Adds a node in the current structure.
*
* <pre>FIB-HEAP-INSERT(H, x)
- * 1 degree[x] <- 0
- * 2 p[x] <- NIL
- * 3 child[x] <- NIL
- * 4 left[x] <- x
- * 5 right[x] <- x
- * 6 mark[x] <- FALSE
+ * 1 degree[x] ← 0
+ * 2 p[x] ← NIL
+ * 3 child[x] ← NIL
+ * 4 left[x] ← x
+ * 5 right[x] ← x
+ * 6 mark[x] ← FALSE
* 7 concatenate the root list containing x with root list H
* 8 if min[H] = NIL or key[x] < key[min[H]]
- * 9 then min[H] <- x
- * 10 n[H] <- n[H] + 1</pre>
+ * 9 then min[H] ← x
+ * 10 n[H] ← n[H] + 1</pre>
*
* @param node the node has to be added.
* @see #offer(Object)