From 0472da3ed643a5957cb1dbe6b790af2528cb5511 Mon Sep 17 00:00:00 2001
From: Niko Matsakis <niko@alum.mit.edu>
Date: Fri, 13 Jul 2018 01:27:13 -0400
Subject: [PATCH] nit: tweak comment order

---
 .../graph/scc/test.rs                         | 44 ++++++++++---------
 1 file changed, 23 insertions(+), 21 deletions(-)

diff --git a/src/librustc_data_structures/graph/scc/test.rs b/src/librustc_data_structures/graph/scc/test.rs
index a273d64a40c..405e1b3a617 100644
--- a/src/librustc_data_structures/graph/scc/test.rs
+++ b/src/librustc_data_structures/graph/scc/test.rs
@@ -85,9 +85,30 @@ fn test_three_sccs() {
 #[test]
 fn test_find_state_2() {
     // The order in which things will be visited is important to this
-    // test. It tests part of the `find_state` behavior.
+    // test. It tests part of the `find_state` behavior. Here is the
+    // graph:
     //
-    // We will start in our DFS by visiting:
+    //
+    //       /----+
+    //     0 <--+ |
+    //     |    | |
+    //     v    | |
+    // +-> 1 -> 3 4
+    // |   |      |
+    // |   v      |
+    // +-- 2 <----+
+
+    let graph = TestGraph::new(0, &[
+        (0, 1),
+        (0, 4),
+        (1, 2),
+        (1, 3),
+        (2, 1),
+        (3, 0),
+        (4, 2),
+    ]);
+
+    // For this graph, we will start in our DFS by visiting:
     //
     // 0 -> 1 -> 2 -> 1
     //
@@ -114,25 +135,6 @@ fn test_find_state_2() {
     // 2 InCycleWith { 1 }
     // 3 InCycleWith { 0 }
 
-    /*
-      /----+
-    0 <--+ |
-    |    | |
-    v    | |
-+-> 1 -> 3 4
-|   |      |
-|   v      |
-+-- 2 <----+
-     */
-    let graph = TestGraph::new(0, &[
-        (0, 1),
-        (0, 4),
-        (1, 2),
-        (1, 3),
-        (2, 1),
-        (3, 0),
-        (4, 2),
-    ]);
     let sccs: Sccs<_, usize> = Sccs::new(&graph);
     assert_eq!(sccs.num_sccs(), 1);
     assert_eq!(sccs.scc(0), 0);
-- 
2.44.0