tigergraph
diff --git a/‎algorithms/Community/connected_components/weakly_connected_components/small_world/tg_algo_wcc_small_world.gsql
-76 b/‎algorithms/Community/connected_components/weakly_connected_components/small_world/tg_algo_wcc_small_world.gsql
-76
diff --git a/‎algorithms/Community/connected_components/weakly_connected_components/small_world/tg_algo_wcc_small_world.yml
-16 b/‎algorithms/Community/connected_components/weakly_connected_components/small_world/tg_algo_wcc_small_world.yml
-16
diff --git a/‎algorithms/Community/connected_components/weakly_connected_components/small_world/tg_wcc_small_world.yml
+1-1 b/‎algorithms/Community/connected_components/weakly_connected_components/small_world/tg_wcc_small_world.yml
+1-1
diff --git a/‎algorithms/GraphML/Embeddings/Node2Vec/CHANGELOG.md
-76 b/‎algorithms/GraphML/Embeddings/Node2Vec/CHANGELOG.md
-76
diff --git a/‎algorithms/GraphML/Embeddings/Node2Vec/README.md
-102 b/‎algorithms/GraphML/Embeddings/Node2Vec/README.md
-102
diff --git a/‎algorithms/GraphML/Embeddings/Node2Vec/tg_node2vec.gsql
-3 b/‎algorithms/GraphML/Embeddings/Node2Vec/tg_node2vec.gsql
-3
diff --git a/‎algorithms/GraphML/Embeddings/Node2Vec/tg_node2vec_sub.cpp
-34 b/‎algorithms/GraphML/Embeddings/Node2Vec/tg_node2vec_sub.cpp
-34
diff --git a/‎algorithms/GraphML/Embeddings/Node2Vec/tg_random_udf.cpp
-28 b/‎algorithms/GraphML/Embeddings/Node2Vec/tg_random_udf.cpp
-28
diff --git a/‎algorithms/GraphML/Embeddings/Node2Vec/tg_random_walk.gsql
-30 b/‎algorithms/GraphML/Embeddings/Node2Vec/tg_random_walk.gsql
-30
@@ -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