From 938d429b6ac409e75f78e013678a66701ce63ce0 Mon Sep 17 00:00:00 2001
From: James <37276661+capjamesg@users.noreply.github.com>
Date: Sat, 30 Mar 2024 21:03:16 +0000
Subject: [PATCH] Update README.md

---
 README.md | 8 ++++++++
 1 file changed, 8 insertions(+)

diff --git a/README.md b/README.md
index bd3375f..19eac62 100644
--- a/README.md
+++ b/README.md
@@ -33,13 +33,21 @@ You can [try the language](https://jamesg.blog/kgl) on a knowledge graph calcula
 
 ```
 { coffee } # Query a single item
+
 { coffee -> is } # Query a relationship of an item
+
 { coffee -> is }! # Show all second degree connections to the results from the query { coffee -> is }
+
 { coffee }? # Query if { coffee } returns a value
+
 { coffee }# # State the number of edges attached to the node
+
 { coffee } <-> { taylor swift } # Find the shortest connecting path between "coffee" and "taylor swift"
+
 { coffee -> isMadeBy ("Company" = "Hasbean") } # Find all coffees made by the company Hasbean
+
 { folklore } + { evermore } # Combine the results of two queries
+
 { taylorSwift | folklore } # Query the "folklore" node in the "taylorSwift" graph (the default graph is called "default" and is implicit)
 ```