tursom/memgraph
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Fix wsp docs

Browse Source 
Summary: s/a/an/

Reviewers: ipaljak

Reviewed By: ipaljak

Differential Revision: https://phabricator.memgraph.io/D1373
This commit is contained in:
Matija Santl 2018-04-23 15:51:21 +02:00
parent 939056eac7
commit 609f33b086
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
docs/user_technical/concepts.md
View File

@ -19,7 +19,7 @@ A sample query that finds a shortest path between two nodes can look like this:
MATCH (a {id: 723})-[le *wShortest 10 (e, n | e.weight) total_weight]-(b {id: 882}) RETURN *
This query has a upper bound length restriction set to `10`. This means that no
This query has an upper bound length restriction set to `10`. This means that no
path that traverses more than `10` edges will be considered as a valid result.