[incubator-age-website] branch master updated: Add Introduction for VLE Section

[jo...@apache.org]

This is an automated email from the ASF dual-hosted git repository.

joshinnis pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/incubator-age-website.git


The following commit(s) were added to refs/heads/master by this push:
     new 3d322de  Add Introduction for VLE Section
3d322de is described below

commit 3d322de02bf421c1c8764c3052e0b2b618a3a239
Author: Josh Innis <Jo...@gmail.com>
AuthorDate: Thu Feb 10 10:40:21 2022 -0800

    Add Introduction for VLE Section
    
    Added a brief introduction section for how variable length
    edges function.
---
 docs/clauses/match.md | 56 ++++++++++++++++++++++++++++++++++++++++++++++++++-
 1 file changed, 55 insertions(+), 1 deletion(-)

diff --git a/docs/clauses/match.md b/docs/clauses/match.md
index b806112..1f9b6bf 100644
--- a/docs/clauses/match.md
+++ b/docs/clauses/match.md
@@ -376,10 +376,64 @@ Returns the movie 'Charlie Sheen' acted in and its director.
 </table>
 
 
-### Variable Length Edges
+## Variable Length Edges
 
 When the connection between two vertices is of variable length, the list of edges that form the connection can be returned using the following connection.
 
+### Introduction
+
+Rather than describing a long path using a sequence of many vertex and edge descriptions in a pattern, many edges (and the intermediate vertices) can be described by specifying a length in the edge description of a pattern.
+
+```
+(u)-[*2]->(v)
+```
+
+Which describes a right directed path of three vertices and two edges can be rewritten to:
+
+```
+(u)-[]->()-[]->(v)
+```
+
+A range lengths can also be given:
+
+
+```
+(u)-[*3..5]->(v)
+```
+
+Which is equivalent to:
+
+```
+(u)-[]->()-[]->()-[]->(v) and
+(u)-[]->()-[]->()-[]->()-[]->(v) and
+(u)-[]->()-[]->()-[]->()-[]->()-[]->(v)
+```
+
+The previous example provided gave the edge both an lower and upper bound for the number of edges (and vertices) between u and v. Either one or both of these binding values can be excluded
+
+
+```
+(u)-[*3..]->(v)
+```
+
+Returns all paths between u and v that have three or more edges included.
+
+```
+(u)-[*..5]->(v)
+```
+
+Returns all paths between u and v that have 5 or fewer edges included.
+
+```
+(u)-[*]->(v)
+```
+
+Returns all paths between u and v
+
+
+### Example
+
+
 Query