Is there any efficient way to find all connected subgraphs

问答 问题
1

I have several isolated subgraph in a graph space like: [1-2, 2-3], [4-5,5-6], [7-8], I want to get subsets of nodes of all connected subgraphs such as:

  [1,2,3], [4,5,6], [7,8] # 3 subgraphs

Can I get these results in an any efficient way by nGQL.

2

You can use wcc algorithm.
ConnectedComponent

1 个赞
3

此话题已在最后回复的 30 天后被自动关闭。不再允许新回复。