From 0c31c15e1a7d71210409babd45002efbd4b41534 Mon Sep 17 00:00:00 2001
From: Dave MacLeod <56599343+Dhghomon@users.noreply.github.com>
Date: Fri, 3 Jan 2025 13:55:32 +0900
Subject: [PATCH] Make placeholder graph nicer, maybe

---
 .../doc-surrealql/datamodel/idioms.mdx        | 20 +++++++------------
 1 file changed, 7 insertions(+), 13 deletions(-)

diff --git a/src/content/doc-surrealql/datamodel/idioms.mdx b/src/content/doc-surrealql/datamodel/idioms.mdx
index 983e128f4..934a7eb60 100644
--- a/src/content/doc-surrealql/datamodel/idioms.mdx
+++ b/src/content/doc-surrealql/datamodel/idioms.mdx
@@ -1205,23 +1205,17 @@ RELATE person:acquaintance3->knows->person:star;
 
 This representation of this small network of friends allows us to visualize the issues that these three algorithms solve. Using `+path` will output all of the possible paths from `person:you`, `+collect` will collect all of the records in this network, and `+shortest=person:star` will find the shortest path.
 
-```                                                                                                                                    
+```   
                                     ┌───►person:acquaintance1                        
                                     │                                                
-                                    │                                                
-                                    │                                                
      ┌───────►  person:friend1      │                                                
      │                │             │                                                
-     │                │             │                                                
-     │                │             ┼───►person:acquaintance2          person:star   
-person:you            │             │                                       ▲        
-     │                │             │                                       │        
-     │                ▼             │                                       │        
-     └────────► person:friend2──────┤                                       │        
-                                    │                                       │        
-                                    │                                       │        
-                                    │                                       │        
-                                    └───►person:acquaintance3───────────────┘                                                          
+     │                │             ┼───►person:acquaintance2     person:star   
+person:you            │             │                                  ▲        
+     │                ▼             │                                  │        
+     └────────► person:friend2──────┤                                  │        
+                                    │                                  │        
+                                    └───►person:acquaintance3──────────┘                      
 ```
 
 To use these algorithms, follow them with the path that should be followed, in this case `->knows->person`.