【图分析】图算法，社团发现算法

社团发现算法介绍

（1）面向整体关系稠密度的三角形计数和聚类系数。
（2）用于发现连通族的强连通分量算法和连通分量算法。
（3）标签传播算法，可基于节点标签快速推断群组。
（4）Louvain模块度算法，用于研究分组的质量和层级结构。

数据导入

使用Neo4j导数数据，首先导入节点

WITH "https://github.com/neo4j-graph-analytics/book/raw/master/data/" AS base
WITH base + "sw-nodes.csv" AS uri
LOAD CSV WITH HEADERS FROM uri AS row
MERGE (:Library {
   id: row.id})

接着导入关系

WITH "https://github.com/neo4j-graph-analytics/book/raw/master/data/" AS base
WITH base + "sw-relationships.csv" AS uri
LOAD CSV WITH HEADERS FROM uri AS row
MATCH (source:Library {
   id: row.src})
MATCH (destination:Library {
   id: row.dst})
MERGE (source)-[:DEPENDS_ON]->