Skip to content
This repository has been archived by the owner on Aug 6, 2020. It is now read-only.

Commit

Permalink
more link to GDSL page into graph algos guide
Browse files Browse the repository at this point in the history
  • Loading branch information
mneedham committed Jul 28, 2020
1 parent b3d85f4 commit 06598a7
Show file tree
Hide file tree
Showing 2 changed files with 4 additions and 19 deletions.
19 changes: 1 addition & 18 deletions graph-data-science/gds-overview.adoc
Original file line number Diff line number Diff line change
Expand Up @@ -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^]
Expand Down
4 changes: 3 additions & 1 deletion graph-data-science/graph-algorithms/graph-algorithms.adoc
Original file line number Diff line number Diff line change
Expand Up @@ -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^].
Expand All @@ -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

Expand Down

0 comments on commit 06598a7

Please sign in to comment.