From 855e0663b3490b3f7cd6b3406a7e96980275b1e8 Mon Sep 17 00:00:00 2001 From: Math3v Date: Sat, 8 Jul 2023 14:05:21 +0200 Subject: [PATCH] Connections Doc Minor Typo Fix --- .../version-v14.0.0/tutorial/connections-pagination.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/website/versioned_docs/version-v14.0.0/tutorial/connections-pagination.md b/website/versioned_docs/version-v14.0.0/tutorial/connections-pagination.md index 4048bd6d80020..78514c376445d 100644 --- a/website/versioned_docs/version-v14.0.0/tutorial/connections-pagination.md +++ b/website/versioned_docs/version-v14.0.0/tutorial/connections-pagination.md @@ -12,7 +12,7 @@ There are three important points to understand: * The list itself has properties, such as whether or not there is a next page available. We handle this with a node that represent the list itself as well as one for the current page. * Pagination is done by *cursors* — opaque symbols that point to the next page of results — rather than offsets. -Imagine we want to show a list of the user’s friends. An a high level, we imagine a graph where the viewer and their friends are each nodes. From the viewer to each friend node is an edge, and the edge itself has properties. +Imagine we want to show a list of the user’s friends. At a high level, we imagine a graph where the viewer and their friends are each nodes. From the viewer to each friend node is an edge, and the edge itself has properties. ![Conceptual graph with properties on its edges](/img/docs/tutorial/connections-conceptual-graph.png)