Research Article
An Approach of Community Search with Minimum Spanning Tree Based on Node Embedding
Figure 3
An example of the improved Prim algorithm. (a) Graph G and a query node s. (b) A minimum spanning tree H in G with 8 nodes starting from s.
| (a) |
| (b) |