EasyGraph

Copyright (C) <2020-2026> by DataNET Group, Fudan University

---

• Documentation: https://easy-graph.github.io/
• Source Code: https://github.com/easy-graph/Easy-Graph
• Issue Tracker: https://github.com/easy-graph/Easy-Graph/issues
• PyPI Homepage: https://pypi.org/project/Python-EasyGraph/
• Youtube channel: https://www.youtube.com/@python-easygraph

Introduction

The framework of EasyGraph is composed of four components: EasyGraph (Core), EasyHypergraph, EGGPU, and EasyGNN.

EasyGraph is an open-source network analysis library primarily written in Python. It supports both undirected and directed networks and accommodates various network data formats. EasyGraph includes a comprehensive suite of network analysis algorithms such as community detection, structural hole spanner detection, network embedding, and motif detection. Additionally, it optimizes performance by implementing key components in C++ and utilizing multiprocessing.

👉 For more details, please refer to our documentation page.

---

EasyHypergraph is a comprehensive, computation-effective, and storage-saving hypergraph computation tool designed not only for in-depth hypergraph analysis but also for the growing field of hypergraph learning. It bridges the gap between EasyGraph and higher-order relationships. EasyHypergraph is developed as an integrated module within the EasyGraph framework, maintaining full compatibility with its core architecture.

👉 For more details, please refer to its documentation page.

---

EGGPU is a high-performance GPU-accelerated network analysis library that supports essential functions such as betweenness centrality, k-core centrality, and single-source shortest path,as well as structural hole metrics like constraint. Built on top of the EasyGraph library, EGGPU features an efficient system architecture and native CUDA implementation, while providing a user-friendly Python API and significant speedups for large-scale network analysis.

👉 For more details, please refer to its documentation page.

📢 EasyGraph News

📣 Media & Press

• [08-09-2025] EasyHypergraph: Fast, Efficient Higher-Order Network Analysis
• [01-15-2025] 开放原子大赛OpenRank开源数字生态分析与应用创新大赛全国一等奖 (in Chinese)
• [01-07-2025] 计算机科学技术学院教授陈阳入选“2024中国开源先锋33人” (in Chinese)
• [12-04-2024] 国际开源基准委员会的"顶级开源证书" (in Chinese)
• [10-16-2024] 2023年度上海开源创新卓越成果奖 (in Chinese)
• [11-06-2023] 复旦大学陈阳Patterns：EasyGraph——面向多学科的高性能网络结构分析工具箱｜Cell Press论文速递 (in Chinese)
• [11-04-2023] EasyGraph：多功能、跨平台、高效率的跨学科网络分析库 (in Chinese)

🚀 Releases & Milestones

• [01-01-2026] EasyGraph v1.5.3 released (The Hypergraph Interchange Format (HIF) standard)
• [11-23-2025] EasyGraph v1.5.2 released (LS algorithm for effective community detection)
• [10-11-2025] EasyGraph v1.5.1 released (Python 3.14 supported)
• [09-29-2025] 🎉 900K+ Downloads! Thanks to our amazing community!
• [07-27-2025] EasyGraph v1.5 released (This version integrates the HWNN model and supports 11 representative network datasets)
• [06-29-2025] 🎉 800K+ Downloads!
• [11-22-2024] EasyGraph v1.4.1 released (Python 3.13 supported)
• [09-20-2024] EasyGraph v1.4 released (GPU-powered functions for large network analysis)
• [05-27-2024] EasyGraph v1.3 released (issues related to hypergraph analysis and visualization resolved)
• [04-09-2024] EasyGraph v1.2 released (Python 3.12 supported)
• [02-05-2024] EasyGraph v1.1 released (hypergraph analysis and learning for higher-order networks)
• [08-17-2023] EasyGraph v1.0 released
• [07-22-2020] EasyGraph first public release

📈 Publications

• [05-30-2025] 🎉 Our paper "EasyHypergraph: an open-source software for fast and memory-saving analysis and learning of higher-order networks" was accepted by Humanities and Social Sciences Communications (Nature Portfolio)! [PDF]
• [08-08-2023] 🎉 Our paper "EasyGraph: A Multifunctional, Cross-Platform, and Effective Library for Interdisciplinary Network Analysis" was accepted by Patterns (Cell Press)! [PDF]

Stargazers

Install

Supported Versions

3.8 <= Python <= 3.14 is required.

Installation With pip

    $ pip install --upgrade Python-EasyGraph

The conda package is no longer updated or maintained.

If you've previously installed EasyGraph with conda, please uninstall it with conda and reinstall with pip.

Build From Source

If prebuilt EasyGraph wheels are not supported for your platform (OS / CPU arch, check here), or you want to have GPU-based functions enabled, you can build it locally.

Prerequisites

• CMake >= 3.23
• A compiler that fully supports C++11
• CUDA Toolkit 11.8 or later would be preferred (If need GPUs enabled)

Installation

On Linux

    git clone --recursive https://github.com/easy-graph/Easy-Graph
    export EASYGRAPH_ENABLE_GPU="TRUE"  # for users who want to enable GPUs
    pip install ./Easy-Graph

On Windows

    % For Windows users who want to enable GPU-based functions, %
    % you must execute the commands below in cmd but not PowerShell. %
    git clone --recursive https://github.com/easy-graph/Easy-Graph
    set EASYGRAPH_ENABLE_GPU=TRUE   % for users who want to enable GPUs %
    pip install ./Easy-Graph

On macOS

    # Since macOS doesn't support CUDA, we can't have GPUs enabled on macOS
    git clone --recursive https://github.com/easy-graph/Easy-Graph
    pip install ./Easy-Graph

Hint

EasyGraph uses 1.12.1 <= PyTorch < 2.0 for machine learning functions. Note that this does not prevent your from running non-machine learning functions normally, if there is no PyTorch in your environment. But you will receive some warnings which remind you some unavailable modules when they depend on it.

Simple Example

This example demonstrates the general usage of methods in EasyGraph.

  >>> import easygraph as eg
  >>> G = eg.Graph()
  >>> G.add_edges([(1,2), (2,3), (1,3), (3,4), (4,5), (3,5), (5,6)])
  >>> eg.pagerank(G)
  {1: 0.14272233049003707, 2: 0.14272233049003694, 3: 0.2685427766200994, 4: 0.14336430577918527, 5: 0.21634929087322705, 6: 0.0862989657474143}

This is a simple example for the detection of structural hole spanners using the HIS algorithm.

  >>> import easygraph as eg
  >>> G = eg.Graph()
  >>> G.add_edges([(1,2), (2,3), (1,3), (3,4), (4,5), (3,5), (5,6)])
  >>> _, _, H = eg.get_structural_holes_HIS(G, C=[frozenset([1,2,3]), frozenset([4,5,6])])
  >>> H # The structural hole score of each node. Note that node `4` is regarded as the most possible structural hole spanner.
  {1: {0: 0.703948974609375},
   2: {0: 0.703948974609375},
   3: {0: 1.2799804687499998},
   4: {0: 1.519976806640625},
   5: {0: 1.519976806640625},
   6: {0: 0.83595703125}
  }

Citation

If you use EasyGraph in a scientific publication, we kindly request that you cite the following paper:

  @article{gao2023easygraph,
      title={{EasyGraph: A Multifunctional, Cross-Platform, and Effective Library for Interdisciplinary Network Analysis}},
      author={Min Gao and Zheng Li and Ruichen Li and Chenhao Cui and Xinyuan Chen and Bodian Ye and Yupeng Li and Weiwei Gu and Qingyuan Gong and Xin Wang and Yang Chen},
      year={2023},
      journal={Patterns},
      volume={4},
      number={10},
      pages={100839},
  }

📢 If you notice anything unexpected, please open an issue and let us know. If you have any questions or require a specific feature, feel free to discuss them with us. We are motivated to constantly make EasyGraph even better and let more developers benefit!