In this report, we introduce a novel approach to visualize extremely large graphs efficiently. Our method combines two force-directed algorithms, Kamada-Kawai and ForceAtlas2, to handle different graph components based on their node count. Additionally, we suggest utilizing the Fast Multipole method to enhance the speed of ForceAtlas2. Although initially designed for analyzing bitcoin transaction graphs, for which we present results here, this algorithm can also be applied to other crypto currency transaction graphs or graphs from diverse domains.

翻译：在本报告中，我们提出了一种高效可视化超大规模图的新方法。该方法结合了两种力导向算法——Kamada-Kawai与ForceAtlas2，以基于节点数量处理不同的图组件。此外，我们建议采用快速多极子方法来提升ForceAtlas2的运行速度。尽管该算法最初是为分析比特币交易图而设计（本文中展示了相关结果），但其同样适用于其他加密货币交易图或来自不同领域的图结构。