From ce1fec88a583bdbb39a12e1fc64aea6a2c6b2b28 Mon Sep 17 00:00:00 2001 From: Gabor Szarnyas Date: Thu, 27 Jul 2023 14:33:44 +0200 Subject: [PATCH] fix: move example images to the images/examples directory --- docs/sql/query_syntax/with.md | 4 ++-- .../examples}/with-recursive-graph-example.png | Bin .../examples}/with-recursive-tree-example.png | Bin 3 files changed, 2 insertions(+), 2 deletions(-) rename {docs/sql/query_syntax => images/examples}/with-recursive-graph-example.png (100%) rename {docs/sql/query_syntax => images/examples}/with-recursive-tree-example.png (100%) diff --git a/docs/sql/query_syntax/with.md b/docs/sql/query_syntax/with.md index 45c5e7172f6..bce8e392be4 100644 --- a/docs/sql/query_syntax/with.md +++ b/docs/sql/query_syntax/with.md @@ -41,7 +41,7 @@ SELECT * FROM cte2; `WITH RECURSIVE` can be used to traverse trees. For example, take a hierarchy of tags: -![](with-recursive-tree-example.png) +![](/images/examples/with-recursive-tree-example.png) ```sql CREATE TABLE tag(id int, name varchar, subclassof int); @@ -88,7 +88,7 @@ One way to achieve this is to store the path of a traversal in a [list](../../sq Take the following directed graph from the [LDBC Graphalytics benchmark](https://arxiv.org/pdf/2011.15028.pdf): -![](with-recursive-graph-example.png) +![](/images/examples/with-recursive-graph-example.png) ```sql CREATE TABLE edge(node1id int, node2id int); diff --git a/docs/sql/query_syntax/with-recursive-graph-example.png b/images/examples/with-recursive-graph-example.png similarity index 100% rename from docs/sql/query_syntax/with-recursive-graph-example.png rename to images/examples/with-recursive-graph-example.png diff --git a/docs/sql/query_syntax/with-recursive-tree-example.png b/images/examples/with-recursive-tree-example.png similarity index 100% rename from docs/sql/query_syntax/with-recursive-tree-example.png rename to images/examples/with-recursive-tree-example.png