JGraphT --一个用于图数据结构和算法的Java库
JGraphT -- A Java library for graph data structures and algorithms
摘要:
数学软件和图论算法包,以有效地建模,分析和查询图形是至关重要的时代,大规模的空间,社会和经济网络数据是丰富的。JGraphT是一个这样的软件包,它是一个编程库,包含非常高效和通用的图形数据结构以及大量最先进的算法。该库是用Java编写的,考虑到了稳定性、互操作性和性能。该库的一个显着特点是能够将顶点和边建模为任意对象,从而允许许多常见网络的自然表示,包括交通,社会和生物网络。除了经典的图算法,如最短路径和生成树算法,该库包含许多先进的算法:图和子图同构;匹配和流问题;近似算法的NP难问题,如独立集和TSP;和一些更奇特的算法,如Berge图检测。由于其通用性和通用设计,JGraphT目前用于大型商业,非商业和学术研究项目。在这项工作中,我们详细描述了库的设计和底层结构,并讨论其最重要的功能和算法。进行计算研究,以评估JGraphT与一些类似的库的性能。在各种流行算法上对大量图进行的实验表明,JGraphT与其他已建立的库(如NetworkX或BGL)相比具有很强的竞争力。
英文摘要:
Mathematical software and graph-theoretical algorithmic packages to efficiently model, analyze and query graphs are crucial in an era where large-scale spatial, societal and economic network data are abundantly available. One such package is JGraphT, a programming library which contains very efficient and generic graph data-structures along with a large collection of state-of-the-art algorithms. The library is written in Java with stability, interoperability and performance in mind. A distinctive feature of this library is the ability to model vertices and edges as arbitrary objects, thereby permitting natural representations of many common networks including transportation, social and biological networks. Besides classic graph algorithms such as shortest-paths and spanning-tree algorithms, the library contains numerous advanced algorithms: graph and subgraph isomorphism; matching and flow problems; approximation algorithms for NP-hard problems such as independent set and TSP; and several more exotic algorithms such as Berge graph detection. Due to its versatility and generic design, JGraphT is currently used in large-scale commercial, non-commercial and academic research projects. In this work we describe in detail the design and underlying structure of the library, and discuss its most important features and algorithms. A computational study is conducted to evaluate the performance of JGraphT versus a number of similar libraries. Experiments on a large number of graphs over a variety of popular algorithms show that JGraphT is highly competitive with other established libraries such as NetworkX or the BGL.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。