neo4j · FlorentinD · Oct 17, 2024 · Oct 15, 2024 · Oct 15, 2024 · Oct 15, 2024
diff --git a/doc/modules/ROOT/pages/tutorials/centrality-algorithms.adoc b/doc/modules/ROOT/pages/tutorials/centrality-algorithms.adoc
@@ -34,9 +34,11 @@ connection to the database.
 
 [source, python, role=no-test]
 ----
-from graphdatascience import GraphDataScience
-import pandas as pd
 import os
+
+import pandas as pd
+
+from graphdatascience import GraphDataScience
 ----
 
 [source, python, role=no-test]
@@ -101,8 +103,8 @@ gds.run_cypher(
 
 gds.run_cypher(
     """
-    UNWIND $rels AS rel 
-    MATCH (source:City {node_id: rel.Origin}), (target:City {node_id: rel.Destination}) 
+    UNWIND $rels AS rel
+    MATCH (source:City {node_id: rel.Origin}), (target:City {node_id: rel.Destination})
     CREATE (source)-[:HAS_FLIGHT_TO]->(target)
     """,
     params={"rels": routes_df.to_dict("records")},

diff --git a/doc/modules/ROOT/pages/tutorials/community-detection.adoc b/doc/modules/ROOT/pages/tutorials/community-detection.adoc
@@ -34,9 +34,11 @@ connection to the database.
 
 [source, python, role=no-test]
 ----
-from graphdatascience import GraphDataScience
-import pandas as pd
 import os
+
+import pandas as pd
+
+from graphdatascience import GraphDataScience
 ----
 
 [source, python, role=no-test]
@@ -114,8 +116,8 @@ gds.run_cypher(
 
 gds.run_cypher(
     """
-    UNWIND $rels AS rel 
-    MATCH (source:Subreddit {name: rel.SOURCE_SUBREDDIT}), (target:Subreddit {name: rel.TARGET_SUBREDDIT}) 
+    UNWIND $rels AS rel
+    MATCH (source:Subreddit {name: rel.SOURCE_SUBREDDIT}), (target:Subreddit {name: rel.TARGET_SUBREDDIT})
     CREATE (source)-[:HYPERLINKED_TO]->(target)
     """,
     params={"rels": relationship_df.to_dict("records")},
@@ -232,7 +234,7 @@ We can also check that the property was written by the below command.
 ----
 gds.run_cypher(
     """
-    MATCH (n) WHERE 'louvainCommunityId' IN keys(n) 
+    MATCH (n) WHERE 'louvainCommunityId' IN keys(n)
     RETURN n.name, n.louvainCommunityId LIMIT 10
     """
 )

diff --git a/doc/modules/ROOT/pages/tutorials/fastrp-and-knn.adoc b/doc/modules/ROOT/pages/tutorials/fastrp-and-knn.adoc
@@ -55,6 +55,7 @@ our GDS client connection to the database.
 [source, python, role=no-test]
 ----
 import os
+
 from graphdatascience import GraphDataScience
 
 # Get Neo4j DB URI and credentials from environment if applicable

diff --git a/doc/modules/ROOT/pages/tutorials/gds-sessions-self-managed.adoc b/doc/modules/ROOT/pages/tutorials/gds-sessions-self-managed.adoc
@@ -34,6 +34,7 @@ version `+1.12a1+` or later.
 [source, python, role=no-test]
 ----
 from datetime import timedelta
+
 %pip install "graphdatascience>=1.12a1"
 ----
 
@@ -50,7 +51,8 @@ is the main entry point for managing GDS Sessions.
 [source, python, role=no-test]
 ----
 import os
-from graphdatascience.session import GdsSessions, AuraAPICredentials
+
+from graphdatascience.session import AuraAPICredentials, GdsSessions
 
 client_id = os.environ["AURA_API_CLIENT_ID"]
 client_secret = os.environ["AURA_API_CLIENT_SECRET"]
@@ -83,11 +85,13 @@ delete the session ourselves.
 [source, python, role=no-test]
 ----
 import os
-from graphdatascience.session import DbmsConnectionInfo, AlgorithmCategory, CloudLocation
-from datetime import timedelta
+
+from graphdatascience.session import AlgorithmCategory, CloudLocation, DbmsConnectionInfo
 
 # Identify the Neo4j DBMS
-db_connection = DbmsConnectionInfo(uri=os.environ["NEO4J_URI"], username=os.environ["NEO4J_USER"], password=os.environ["NEO4J_PASSWORD"])
+db_connection = DbmsConnectionInfo(
+    uri=os.environ["NEO4J_URI"], username=os.environ["NEO4J_USER"], password=os.environ["NEO4J_PASSWORD"]
+)
 # Specify where to create the GDS session
 cloud_location = CloudLocation(provider="gcp", region="europe-west1")
 

diff --git a/doc/modules/ROOT/pages/tutorials/gds-sessions.adoc b/doc/modules/ROOT/pages/tutorials/gds-sessions.adoc
@@ -50,7 +50,8 @@ is the main entry point for managing GDS Sessions.
 [source, python, role=no-test]
 ----
 import os
-from graphdatascience.session import GdsSessions, AuraAPICredentials
+
+from graphdatascience.session import AuraAPICredentials, GdsSessions
 
 client_id = os.environ["AURA_API_CLIENT_ID"]
 client_secret = os.environ["AURA_API_CLIENT_SECRET"]
@@ -84,10 +85,13 @@ delete the session ourselves.
 ----
 import os
 from datetime import timedelta
-from graphdatascience.session import DbmsConnectionInfo, AlgorithmCategory
+
+from graphdatascience.session import AlgorithmCategory, DbmsConnectionInfo
 
 # Identify the AuraDB instance
-db_connection = DbmsConnectionInfo(uri=os.environ["AURA_DB_ADDRESS"], username=os.environ["AURA_DB_USER"], password=os.environ["AURA_DB_PW"])
+db_connection = DbmsConnectionInfo(
+    uri=os.environ["AURA_DB_ADDRESS"], username=os.environ["AURA_DB_USER"], password=os.environ["AURA_DB_PW"]
+)
 # Create a GDS session!
 memory = sessions.estimate(
     node_count=20,

diff --git a/...odules/ROOT/pages/tutorials/heterogeneous-node-classification-with-hashgnn.adoc b/...odules/ROOT/pages/tutorials/heterogeneous-node-classification-with-hashgnn.adoc
@@ -44,6 +44,7 @@ connection to the database.
 ----
 # Import our dependencies
 import os
+
 from graphdatascience import GraphDataScience
 ----
 

diff --git a/doc/modules/ROOT/pages/tutorials/import-sample-export-gnn.adoc b/doc/modules/ROOT/pages/tutorials/import-sample-export-gnn.adoc
@@ -57,15 +57,16 @@ connection to the database.
 [source, python, role=no-test]
 ----
 import os
-import pandas as pd
-from graphdatascience import GraphDataScience
+import random
+
+import numpy as np
 import torch
-from torch_geometric.data import Data
 import torch.nn.functional as F
+from torch_geometric.data import Data
 from torch_geometric.nn import GCNConv
 from torch_geometric.transforms import RandomNodeSplit
-import random
-import numpy as np
+
+from graphdatascience import GraphDataScience
 ----
 
 [source, python, role=no-test]

diff --git a/doc/modules/ROOT/pages/tutorials/kge-predict-transe-pyg-train.adoc b/doc/modules/ROOT/pages/tutorials/kge-predict-transe-pyg-train.adoc
@@ -48,15 +48,17 @@ connection to the database.
 
 [source, python, role=no-test]
 ----
+import collections
 import os
-from graphdatascience import GraphDataScience
+
+import pandas as pd
 import torch
 import torch.optim as optim
 from torch_geometric.data import Data, download_url
 from torch_geometric.nn import TransE
-import collections
 from tqdm import tqdm
-import pandas as pd
+
+from graphdatascience import GraphDataScience
 ----
 
 [source, python, role=no-test]

diff --git a/doc/modules/ROOT/pages/tutorials/load-data-via-graph-construction.adoc b/doc/modules/ROOT/pages/tutorials/load-data-via-graph-construction.adoc
@@ -33,6 +33,7 @@ the `+graphdatascience+` package and import the client class.
 [source, python, role=no-test]
 ----
 import os
+
 from graphdatascience import GraphDataScience
 ----
 

diff --git a/doc/modules/ROOT/pages/tutorials/ml-pipelines-node-classification.adoc b/doc/modules/ROOT/pages/tutorials/ml-pipelines-node-classification.adoc
@@ -37,6 +37,7 @@ install the `+graphdatascience+` package and import the client class.
 [source, python, role=no-test]
 ----
 import os
+
 from graphdatascience import GraphDataScience
 ----
 

diff --git a/examples/centrality-algorithms.ipynb b/examples/centrality-algorithms.ipynb
@@ -30,7 +30,7 @@
     "\n",
     "This notebook will show how you can apply eigenvector centrality, betweenness centrality, degree centrality and closeness centrality on a graph dataset.\n",
     "\n",
-    "### Setup\n",
+    "## Setup\n",
     "\n",
     "We start by importing our dependencies and setting up our GDS client connection to the database."
    ]
@@ -51,9 +51,11 @@
    "metadata": {},
    "outputs": [],
    "source": [
-    "from graphdatascience import GraphDataScience\n",
+    "import os\n",
+    "\n",
     "import pandas as pd\n",
-    "import os"
+    "\n",
+    "from graphdatascience import GraphDataScience"
    ]
   },
   {
@@ -92,7 +94,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "### Importing the dataset\n",
+    "## Importing the dataset\n",
     "\n",
     "We import the dataset as a pandas dataframe first. We deal with two files here. The file `reachability-meta.csv.gz` stores the names of the cities and their information while the file `reachability.txt.gz` stores the edges of the graph. An edge exists from city `i` to city `j` if the estimated airline travel time is less than a threshold.\n"
    ]
@@ -146,8 +148,8 @@
     "\n",
     "gds.run_cypher(\n",
     "    \"\"\"\n",
-    "    UNWIND $rels AS rel \n",
-    "    MATCH (source:City {node_id: rel.Origin}), (target:City {node_id: rel.Destination}) \n",
+    "    UNWIND $rels AS rel\n",
+    "    MATCH (source:City {node_id: rel.Origin}), (target:City {node_id: rel.Destination})\n",
     "    CREATE (source)-[:HAS_FLIGHT_TO]->(target)\n",
     "    \"\"\",\n",
     "    params={\"rels\": routes_df.to_dict(\"records\")},\n",
@@ -174,7 +176,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "### Eigenvector Centrality\n",
+    "## Eigenvector Centrality\n",
     "\n",
     "[Eigenvector centrality](https://neo4j.com/docs/graph-data-science/current/algorithms/eigenvector-centrality/) measures the importance or influence of a node based on its connections to other nodes in the network. A higher eigenvector centrality score suggests that a node is more central and influential within the network.\n",
     "\n",
@@ -289,7 +291,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "### Betweenness Centrality\n",
+    "## Betweenness Centrality\n",
     "\n",
     "[Betweenness Centrality](https://neo4j.com/docs/graph-data-science/current/algorithms/betweenness-centrality/) quantifies the importance of a node as a bridge or intermediary in the network. It measures how often a node lies on the shortest path between other pairs of nodes. \n",
     "\n",
@@ -367,7 +369,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "### Degree Centrality\n",
+    "## Degree Centrality\n",
     "\n",
     "[Degree Centrality](https://neo4j.com/docs/graph-data-science/current/algorithms/degree-centrality/) measures the number of connections (edges) a node has in the network. \n",
     "\n",
@@ -445,7 +447,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "### Cleanup\n",
+    "## Cleanup\n",
     "\n",
     "Before finishing we can clean up the example data from both the GDS in-memory state and the database."
    ]
@@ -474,7 +476,7 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "### References\n",
+    "## References\n",
     "- For the network:\n",
     "Brendan J. Frey and Delbert Dueck. \"Clustering by passing messages between data points.\" Science 315.5814 (2007): 972-976.\n",
     "\n",

diff --git a/examples/community-detection.ipynb b/examples/community-detection.ipynb
@@ -33,7 +33,7 @@
     "\n",
     "The tasks we cover here include performing initial graph preprocessing using Weakly Connected Components and then performing community detection on the largest component using the Louvain algorithm.\n",
     "\n",
-    "### Setup\n",
+    "## Setup\n",
     "\n",
     "We start by importing our dependencies and setting up our GDS client connection to the database."
    ]
@@ -56,9 +56,11 @@
    "metadata": {},
    "outputs": [],
    "source": [
-    "from graphdatascience import GraphDataScience\n",
+    "import os\n",
+    "\n",
     "import pandas as pd\n",
-    "import os"
+    "\n",
+    "from graphdatascience import GraphDataScience"
    ]
   },
   {
@@ -100,7 +102,7 @@
    "id": "48bd8af1",
    "metadata": {},
    "source": [
-    "### Importing the dataset\n",
+    "## Importing the dataset\n",
     "\n",
     "We import the dataset as a pandas dataframe first. We work with only a subset of the dataset. The sampled data is only till 1st March 2014. "
    ]
@@ -187,8 +189,8 @@
     "\n",
     "gds.run_cypher(\n",
     "    \"\"\"\n",
-    "    UNWIND $rels AS rel \n",
-    "    MATCH (source:Subreddit {name: rel.SOURCE_SUBREDDIT}), (target:Subreddit {name: rel.TARGET_SUBREDDIT}) \n",
+    "    UNWIND $rels AS rel\n",
+    "    MATCH (source:Subreddit {name: rel.SOURCE_SUBREDDIT}), (target:Subreddit {name: rel.TARGET_SUBREDDIT})\n",
     "    CREATE (source)-[:HYPERLINKED_TO]->(target)\n",
     "    \"\"\",\n",
     "    params={\"rels\": relationship_df.to_dict(\"records\")},\n",
@@ -226,7 +228,7 @@
    "id": "9c259471",
    "metadata": {},
    "source": [
-    "### Weakly Connected Components\n",
+    "## Weakly Connected Components\n",
     "\n",
     "A graph dataset need not always be connected. That is, there may not exist a path from every node to \n",
     "every other node in the graph dataset (subgraphs in it may not be connected to each other at all). Hence, we \n",
@@ -332,7 +334,7 @@
    "id": "17942d04",
    "metadata": {},
    "source": [
-    "### Community Detection using Louvain\n",
+    "## Community Detection using Louvain\n",
     "\n",
     "We use the [Louvain](https://neo4j.com/docs/graph-data-science/current/algorithms/louvain/) algorithm to detect communities in our subgraph and assign a `louvainCommunityId` to each community."
    ]
@@ -382,7 +384,7 @@
    "source": [
     "gds.run_cypher(\n",
     "    \"\"\"\n",
-    "    MATCH (n) WHERE 'louvainCommunityId' IN keys(n) \n",
+    "    MATCH (n) WHERE 'louvainCommunityId' IN keys(n)\n",
     "    RETURN n.name, n.louvainCommunityId LIMIT 10\n",
     "    \"\"\"\n",
     ")"
@@ -424,7 +426,7 @@
    "id": "5ed56f82",
    "metadata": {},
    "source": [
-    "### Further ideas\n",
+    "## Further ideas\n",
     "\n",
     "* Inspect the produced communities using [Bloom](https://neo4j.com/docs/bloom-user-guide/current/). You can use rule-based styling based on the community property.\n",
     "* Try to tune more parameters of Louvain and see how the communities differ.\n",
@@ -437,7 +439,7 @@
    "id": "6e00ed7b",
    "metadata": {},
    "source": [
-    "### Cleanup\n",
+    "## Cleanup\n",
     "\n",
     "Before finishing we can clean up the example data from both the GDS in-memory state and the database."
    ]
@@ -471,7 +473,7 @@
    "id": "65dcb952",
    "metadata": {},
    "source": [
-    "### References\n",
+    "## References\n",
     "\n",
     "Srijan Kumar, William L. Hamilton, Jure Leskovec, and Dan Jurafsky. 2018. Community Interaction and Conflict on the Web. In Proceedings of the 2018 World Wide Web Conference (WWW '18). International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, CHE, 933–943. https://doi.org/10.1145/3178876.3186141"
    ]

diff --git a/examples/fastrp-and-knn.ipynb b/examples/fastrp-and-knn.ipynb
@@ -77,6 +77,7 @@
    "outputs": [],
    "source": [
     "import os\n",
+    "\n",
     "from graphdatascience import GraphDataScience\n",
     "\n",
     "# Get Neo4j DB URI and credentials from environment if applicable\n",
-Original file line number
+Diff line change
@@ Expand Up / @@ -44,6 +44,7 @@ connection to the database. @@
     ----
     # Import our dependencies
     import os
     from graphdatascience import GraphDataScience
     ----
@@ Expand Down @@