author Manu Sporny Wed, 10 Aug 2011 16:01:00 -0400 changeset 149 fd6d40c6bcd5 parent 148 35d14e90fc5c child 150 9de6ef1ed9e4
Fixed spec bug in the deterministic Labeling Algorithm.
 spec/latest/index.html
```--- a/spec/latest/index.html	Wed Aug 10 15:16:38 2011 -0400
+++ b/spec/latest/index.html	Wed Aug 10 16:01:00 2011 -0400
@@ -2361,34 +2361,35 @@
the graph.

<ol class="algorithm">
-   <li>Initialize the <tdef>normalized node counter</tdef> to <code>0</code> and
-     the <tdef>sorted list of expanded nodes</tdef> to an empty array.</li>
-   <li>Copy all of the nodes in the
-    <tref>map of expanded nodes</tref> into a
-    <tref>list of expanded nodes</tref>.
-   <li>Move every node with an IRI that does not start with <code>_:</code>
-     from the <tref>list of expanded nodes</tref> into the
-     <tref>sorted list of expanded nodes</tref> and sort the
-     <tref>sorted list of expanded nodes</tref> according to the steps
-     in the
-     <a href="#deep-comparison-algorithm">Deep Comparison Algorithm</a>.</li>
-   <li>Append to the <tref>sorted list of expanded nodes</tref> by processing
+  <li>Initialize the <tdef>normalized node counter</tdef> to <code>0</code> and
+    the <tdef>sorted list of expanded nodes</tdef> to an empty array.</li>
+  <li>Copy all of the nodes in the
+   <tref>map of expanded nodes</tref> into a
+   <tref>list of expanded nodes</tref>.
+  <li>Move every node with an IRI that does not start with <code>_:</code>
+    from the <tref>list of expanded nodes</tref> into the
+    <tref>sorted list of expanded nodes</tref>.</li>
+  <li>Append to the <tref>sorted list of expanded nodes</tref> by processing
the remainder of the <tref>list of expanded nodes</tref> until it is empty:
-     <ol class="algorithm">
-       <li>Sort the <tref>list of expanded nodes</tref> in descending order
-         using the
-         <a href="#deep-comparison-algorithm">Deep Comparison Algorithm</a> to
-         determine the sort order.</li>
-      <li>Remove and relabel the first node in the
-         resorted <tref>list of expanded nodes</tref> according to the
-         <a href="#node-relabeling-algorithm">Node Relabeling Algorithm</a>.
-         The <tref>new label</tref> MUST be created by concatenating
-         <code>_:c14n</code> with the value from the
-         <tref>normalized node counter</tref>. Add the relabeled node into the
-         <tref>sorted list of expanded nodes</tdef>.
-         </li>
-      <li>Increase the <tref>normalized node counter</tref> by <code>1</code>.
-        </ol></li>
+    <ol class="algorithm">
+      <li>Sort the <tref>list of expanded nodes</tref> in descending order
+        using the
+        <a href="#deep-comparison-algorithm">Deep Comparison Algorithm</a> to
+        determine the sort order.</li>
+     <li>Remove and relabel the first node in the
+        resorted <tref>list of expanded nodes</tref> according to the
+        <a href="#node-relabeling-algorithm">Node Relabeling Algorithm</a>.
+        The <tref>new label</tref> MUST be created by concatenating
+        <code>_:c14n</code> with the value from the
+        <tref>normalized node counter</tref>. Add the relabeled node into the
+        <tref>sorted list of expanded nodes</tdef>.
+        </li>
+     <li>Increase the <tref>normalized node counter</tref> by <code>1</code>.
+       </ol></li>
+  <li>Sort the <tref>sorted list of expanded nodes</tref> in descending order
+    using the
+    <a href="#deep-comparison-algorithm">Deep Comparison Algorithm</a> to
+    determine the sort order.</li>
</ol>
</section>
```