add random state argumment and update copyright

rapidsai · Dec 31, 2024 · 618fe76 · 618fe76
1 parent bb77237
commit 618fe76
Show file tree

Hide file tree

Showing 2 changed files with 6 additions and 3 deletions.
diff --git a/python/cugraph/cugraph/sampling/node2vec_random_walks.py b/python/cugraph/cugraph/sampling/node2vec_random_walks.py
@@ -1,4 +1,4 @@
-# Copyright (c) 2022-2024, NVIDIA CORPORATION.
+# Copyright (c) 2024, NVIDIA CORPORATION.
 # Licensed under the Apache License, Version 2.0 (the "License");
 # you may not use this file except in compliance with the License.
 # You may obtain a copy of the License at

diff --git a/python/cugraph/cugraph/sampling/uniform_random_walks.py b/python/cugraph/cugraph/sampling/uniform_random_walks.py
@@ -1,4 +1,4 @@
-# Copyright (c) 2024, NVIDIA CORPORATION.
+# Copyright (c) 2022-2024, NVIDIA CORPORATION.
 # Licensed under the Apache License, Version 2.0 (the "License");
 # you may not use this file except in compliance with the License.
 # You may obtain a copy of the License at
@@ -20,14 +20,14 @@
 
 from cugraph.structure import Graph
 
-import warnings
 from typing import Union, Tuple
 
 
 def uniform_random_walks(
     G: Graph,
     start_vertices: Union[int, list, cudf.Series, cudf.DataFrame] = None,
     max_depth: int = None,
+    random_state: int = None,
 ) -> Tuple[cudf.Series, cudf.Series, Union[None, int, cudf.Series]]:
     """
     Compute uniform random walks for each nodes in 'start_vertices'.
@@ -50,6 +50,9 @@ def uniform_random_walks(
         The max depth is relative to the number of edges hence the vertex_paths size
         is max_depth + 1. For instance, a 'max_depth' of 2 with only one seed will
         result in a vertex_path of size 3.
+    
+    random_state: int, optional
+        Random seed to use when making sampling calls.
 
 
     Returns