From 2ade61411a014b3eed24bd2b382687d55233a9b5 Mon Sep 17 00:00:00 2001 From: leshe4ka46 Date: Sat, 15 Nov 2025 16:30:38 +0300 Subject: R(Cluster) --- .../2-04_networkx_cugraph.ipynb | 19 +++++++++++++++++-- 1 file changed, 17 insertions(+), 2 deletions(-) (limited to 'Fundamentals_of_Accelerated_Data_Science/2-04_networkx_cugraph.ipynb') diff --git a/Fundamentals_of_Accelerated_Data_Science/2-04_networkx_cugraph.ipynb b/Fundamentals_of_Accelerated_Data_Science/2-04_networkx_cugraph.ipynb index 48764b4..e6f3382 100644 --- a/Fundamentals_of_Accelerated_Data_Science/2-04_networkx_cugraph.ipynb +++ b/Fundamentals_of_Accelerated_Data_Science/2-04_networkx_cugraph.ipynb @@ -61,6 +61,19 @@ "RAPIDS recently introduced a new backend to NetworkX called nx-cugraph. With this backend, you can automatically accelerate supported algorithms. In this notebook, we will cover the various methods of enabling the cugraph backend, and use the backend to run different centrality algorithms." ] }, + { + "cell_type": "code", + "execution_count": null, + "id": "7375dbf9", + "metadata": {}, + "outputs": [], + "source": [ + "# https://networkx.org/documentation/stable/reference/configs.html\n", + "\n", + "# nx.config.backend_priority = [\"cugraph\", \"..\"]\n", + "# env NETWORKX_BACKEND_PRIORITY=\"cugraph,..\"" + ] + }, { "cell_type": "markdown", "id": "697ea4c9-b416-43d5-9d2c-28aa41ef2561", @@ -291,12 +304,14 @@ "### Pagerank Centrality ###\n", "Determines a node's importance based on the quantity and quality of links to it, similar to Google's original PageRank algorithm\n", "\n", - "PageRank’s main difference from EigenCentrality is that it accounts for link direction. Each node in a network is assigned a score based on its number of incoming links (its ‘indegree’). These links are also weighted depending on the relative score of its originating node." + "PageRank’s main difference from EigenCentrality is that it accounts for link direction. Each node in a network is assigned a score based on its number of incoming links (its ‘indegree’). These links are also weighted depending on the relative score of its originating node.\n", + "\n", + "1/n" ] }, { "cell_type": "code", - "execution_count": 9, + "execution_count": null, "id": "a17ee15b-8758-484b-82b9-a158187231c5", "metadata": {}, "outputs": [], -- cgit v1.2.3