diff --git a/showgraphs.m b/showgraphs.m
index 2d71c7db010b24428e83e09aab7709ae7920c6c3..42beccd4041b9dccdceb090f5778542b37bf61fb 100644
--- a/showgraphs.m
+++ b/showgraphs.m
@@ -8,8 +8,6 @@ Needs["ErrorBarPlots`"]
 
 
 (* ::Text:: *)
-(*- Experimental mixing time as function of n. At (n,tau)=(1000,2.5) it seems to be between 10.000 and 20.000 steps.*)
-(**)
 (*- Use different starting point for switch chain that is closer to uniform:*)
 (*   Do configuration model, starting with the vertex with highest degree and keeping track of a "forbidden list" meaning dont pair something that is not allowed*)
 (*   (a) How close is this to uniform ? At least w.r.t. the measure of #triangles*)
@@ -35,6 +33,9 @@ Needs["ErrorBarPlots`"]
 (*  - Improve runtime*)
 (*   (a) Don't remove/add edges from the std::vector. Simply replace them. Done, is way faster for large n.*)
 (*   (b) Do not choose the three permutations with 1/3 probability: choose the "staying" one with zero probability. Should still be a valid switch chain?*)
+(*   *)
+(*   - Experimental mixing time as function of n. At (n,tau)=(1000,2.5) it seems to be between 10.000 and 20.000 steps.*)
+(*     Done. Seems to be something like  (1/2)(32-26(tau-2))n  so we run it for that time without the factor (1/2).*)
 (*  *)
 (*  *)
 
@@ -64,7 +65,7 @@ Grid[Partition[gs,10],Frame->All]
 (*Data import and data merge*)
 
 
-gsraw=Import[NotebookDirectory[]<>"data/graphdata2.m"];
+gsraw=Import[NotebookDirectory[]<>"data/graphdata.m"];
 gsraw=SortBy[gsraw,#[[1,1]]&]; (* Sort by n *)