TLDR
The dataset we used in this article is: A Song of Ice and Fire Volume One to Volume Five. We will use the built-in community detection algorithm Girvan-Newman provided by NetworkX to divide communities for our graph network. The algorithm’s steps for community detection are summarized below:. The importance of each vertices in the graph can be measured by the centrality of it. The graph is stored in the open source graph database Nebula Graph with NetworkX. We use the Betweenness Centrality algorithm to achieve our goals.via the TL;DR App
no story
Written by jamie1023 | Nebula Graph is an open-source distributed graph database: https://github.com/vesoft-inc/nebula
