tigergraph · katinar · Mar 21, 2024 · Mar 20, 2024 · Mar 20, 2024
diff --git a/...connected_components/weakly_connected_components/small_world/tg_algo_wcc_small_world.gsql b/...connected_components/weakly_connected_components/small_world/tg_algo_wcc_small_world.gsql
diff --git a/.../connected_components/weakly_connected_components/small_world/tg_algo_wcc_small_world.yml b/.../connected_components/weakly_connected_components/small_world/tg_algo_wcc_small_world.yml
diff --git a/...unity/connected_components/weakly_connected_components/small_world/tg_wcc_small_world.yml b/...unity/connected_components/weakly_connected_components/small_world/tg_wcc_small_world.yml
@@ -12,4 +12,4 @@
     sha_id: ed6ea869749977cc0f3df71225d7325fb81c9767
     description: "This algorithm is optimized for finding connected components in small-world graphs, where the vast majority of the vertices in the graph are weakly connected to form a hub community."
     version: lib3.0
-    include: false
+    include: true
diff --git a/algorithms/GraphML/Embeddings/Node2Vec/CHANGELOG.md b/algorithms/GraphML/Embeddings/Node2Vec/CHANGELOG.md
diff --git a/algorithms/GraphML/Embeddings/Node2Vec/README.md b/algorithms/GraphML/Embeddings/Node2Vec/README.md
diff --git a/algorithms/GraphML/Embeddings/Node2Vec/tg_node2vec.gsql b/algorithms/GraphML/Embeddings/Node2Vec/tg_node2vec.gsql
diff --git a/algorithms/GraphML/Embeddings/Node2Vec/tg_node2vec_sub.cpp b/algorithms/GraphML/Embeddings/Node2Vec/tg_node2vec_sub.cpp
diff --git a/algorithms/GraphML/Embeddings/Node2Vec/tg_random_udf.cpp b/algorithms/GraphML/Embeddings/Node2Vec/tg_random_udf.cpp
diff --git a/algorithms/GraphML/Embeddings/Node2Vec/tg_random_walk.gsql b/algorithms/GraphML/Embeddings/Node2Vec/tg_random_walk.gsql