From 06598a705616bfb699ec94c9ce68f7628b4c965b Mon Sep 17 00:00:00 2001
From: Mark Needham <m.h.needham@gmail.com>
Date: Tue, 28 Jul 2020 11:40:13 +0100
Subject: [PATCH] more link to GDSL page into graph algos guide

---
 graph-data-science/gds-overview.adoc          | 19 +------------------
 .../graph-algorithms/graph-algorithms.adoc    |  4 +++-
 2 files changed, 4 insertions(+), 19 deletions(-)

diff --git a/graph-data-science/gds-overview.adoc b/graph-data-science/gds-overview.adoc
index d7fb8b35..40bd389b 100644
--- a/graph-data-science/gds-overview.adoc
+++ b/graph-data-science/gds-overview.adoc
@@ -49,30 +49,13 @@ The Neo4j Graph Data Science Library (GDSL) provides efficiently implemented, pa
 The library contains implementations of classic graph algorithms in the path finding, centrality, and community detection categories.
 It also includes algorithms that are well suited for data science problems, like link prediction and weighted and unweighted similarity.
 
-++++
-<div style="display:flex;">
-  <div class="paragraph" style="margin-right: 20px;">
-    <p>
-      <a href="/developer/graph-algorithms" class="medium button">Get started with Graph Algorithms</a>
-    </p>
-  </div>
-  <div class="paragraph">
-    <p>
-      <a href="/graph-data-science-library" class="medium button">Learn more about GDSL</a>
-    </p>
-  </div>
-
-</div>
-++++
-
+link:/developer/graph-algorithms[Get started with GDSL, role="medium button"]
 
 [#graph-data-science-playground]
 == NEuler: The Graph Data Science Playground
 
 image:https://dist.neo4j.com/wp-content/uploads/np_swing_206_C595E4.png[Graph Data Science Playground, width="100px",float="right",margin-left:"2px"]
 
-
-
 NEuler (Neo4j Euler) is a link:/developer/graph-apps/[graph app^] that helps Neo4j Desktop users get started with the Neo4j Graph Data Science Library.
 
 * https://medium.com/neo4j/introducing-neuler-the-graph-algorithms-playground-d81042cfcd56[Introducing NEuler — The Graph Algorithms Playground^]
diff --git a/graph-data-science/graph-algorithms/graph-algorithms.adoc b/graph-data-science/graph-algorithms/graph-algorithms.adoc
index 2b4833a9..e30bc2e9 100644
--- a/graph-data-science/graph-algorithms/graph-algorithms.adoc
+++ b/graph-data-science/graph-algorithms/graph-algorithms.adoc
@@ -17,7 +17,7 @@ Graph algorithms provide one of the most potent approaches to analyzing connecte
 They describe steps to be taken to process a graph to discover its general qualities or specific quantities.
 
 [#neo4j-algorithms-library]
-== Graph Data Science Library
+== Neo4j Graph Data Science Library (GDSL)
 
 Neo4j Graph Data Science is a library that provides efficiently implemented, parallel versions of common graph algorithms for Neo4j 3.x and Neo4j 4.x exposed as link:/developer/cypher/[Cypher] procedures.
 It forms the core part of your link:/developer/graph-data-science[Graph Data Science platform^].
@@ -42,6 +42,8 @@ The library contains implementations for the following types of algorithms:
 
 * link:/docs/graph-data-science/1.3-preview/algorithms/node-embeddings/[Node Embeddings^] - these algorithms compute vector representations of nodes in a graph.
 
+link:/graph-data-science-library[Learn more about Neo4j GDSL^, role="medium button"]
+
 [#start-graph-algorithms]
 == Getting Started