From 43cbacae45bbb243a426eec5646a13554dfbce50 Mon Sep 17 00:00:00 2001
From: juan <juancloudcomputing@protonmail.com>
Date: Wed, 7 Sep 2022 21:30:22 +0800
Subject: [PATCH] vault backup: 2022-09-07 21:30:22

---
 .obsidian/graph.json                         | 38 +++++---------------
 OJ notes/pages/Leetcode Linked-List-Cycle.md |  2 +-
 2 files changed, 9 insertions(+), 31 deletions(-)

diff --git a/.obsidian/graph.json b/.obsidian/graph.json
index 3a9362a..69f7ad4 100644
--- a/.obsidian/graph.json
+++ b/.obsidian/graph.json
@@ -6,39 +6,17 @@
   "hideUnresolved": true,
   "showOrphans": false,
   "collapse-color-groups": false,
-  "colorGroups": [
-    {
-      "query": "tag:#coding_problem",
-      "color": {
-        "a": 1,
-        "rgb": 6523645
-      }
-    },
-    {
-      "query": "tag:#CS_analysis",
-      "color": {
-        "a": 1,
-        "rgb": 14725458
-      }
-    },
-    {
-      "query": "tag:#TODO",
-      "color": {
-        "a": 1,
-        "rgb": 14701138
-      }
-    }
-  ],
+  "colorGroups": [],
   "collapse-display": false,
-  "showArrow": true,
+  "showArrow": false,
   "textFadeMultiplier": 0,
   "nodeSizeMultiplier": 1,
   "lineSizeMultiplier": 1,
   "collapse-forces": false,
-  "centerStrength": 0.5,
-  "repelStrength": 10.5952380952381,
-  "linkStrength": 0.505952380952381,
-  "linkDistance": 259,
-  "scale": 0.34081054256054544,
-  "close": false
+  "centerStrength": 0.518713248970312,
+  "repelStrength": 10,
+  "linkStrength": 1,
+  "linkDistance": 250,
+  "scale": 0.3914511147741139,
+  "close": true
 }
\ No newline at end of file
diff --git a/OJ notes/pages/Leetcode Linked-List-Cycle.md b/OJ notes/pages/Leetcode Linked-List-Cycle.md
index e9b45e0..2ca6f93 100644
--- a/OJ notes/pages/Leetcode Linked-List-Cycle.md	
+++ b/OJ notes/pages/Leetcode Linked-List-Cycle.md	
@@ -75,7 +75,7 @@ Return `true` _if there is a cycle in the linked list_. Otherwise, return `fals
 
 > [!summary] > **Algorithm:**
 > This is a #Floyd_s_cycle_finding_algorithm.
-> This is pretty straightforward, visit for more info
+> This is pretty straightforward, visit [[Floyd's Cycle Finding Algorithm]] for more info
 
 ### Solution