亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

JGraphT—A Java Library for Graph Data Structures and Algorithms

计算机科学 算法 斯坦纳树问题 Java 子图同构问题 理论计算机科学 图形数据库 图形 数学 程序设计语言 离散数学
作者
Dimitrios Michail,Joris Kinable,Barak Naveh,John Sichi
出处
期刊:ACM Transactions on Mathematical Software [Association for Computing Machinery]
卷期号:46 (2): 1-29 被引量:104
标识
DOI:10.1145/3381449
摘要

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 that 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 its 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 the traveling salesman problem, 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 products, as well as noncommercial 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 several 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.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
可爱的香菇完成签到 ,获得积分10
1秒前
5秒前
dovejingling完成签到,获得积分10
8秒前
lulu发布了新的文献求助20
11秒前
Jasper应助科研通管家采纳,获得10
19秒前
顾矜应助科研通管家采纳,获得10
19秒前
19秒前
李沐唅完成签到 ,获得积分10
23秒前
核桃发布了新的文献求助30
29秒前
30秒前
阿凯完成签到 ,获得积分10
35秒前
zzx发布了新的文献求助10
36秒前
zzx完成签到,获得积分10
42秒前
小泉完成签到 ,获得积分10
47秒前
星辰大海应助高兴的忆曼采纳,获得10
1分钟前
英姑应助核桃采纳,获得10
1分钟前
科研通AI5应助核桃采纳,获得10
1分钟前
科研通AI5应助核桃采纳,获得10
1分钟前
可爱的函函应助核桃采纳,获得10
1分钟前
Liufgui应助核桃采纳,获得10
1分钟前
在水一方应助核桃采纳,获得10
1分钟前
隐形曼青应助科研通管家采纳,获得10
2分钟前
丘比特应助科研通管家采纳,获得10
2分钟前
爆米花应助科研通管家采纳,获得10
2分钟前
LONG完成签到 ,获得积分10
2分钟前
秋风今是完成签到 ,获得积分10
2分钟前
2分钟前
核桃发布了新的文献求助10
2分钟前
biubiubiu驳回了852应助
3分钟前
AUGKING27完成签到 ,获得积分10
3分钟前
3分钟前
3分钟前
3分钟前
无语的诗柳完成签到 ,获得积分10
3分钟前
nina完成签到 ,获得积分10
3分钟前
远山淡影_cy完成签到,获得积分20
3分钟前
康谨完成签到 ,获得积分10
4分钟前
blenx完成签到,获得积分10
4分钟前
4分钟前
小叶子完成签到 ,获得积分10
4分钟前
高分求助中
The Mother of All Tableaux: Order, Equivalence, and Geometry in the Large-scale Structure of Optimality Theory 3000
A new approach to the extrapolation of accelerated life test data 1000
ACSM’s Guidelines for Exercise Testing and Prescription, 12th edition 500
Indomethacinのヒトにおける経皮吸収 400
Phylogenetic study of the order Polydesmida (Myriapoda: Diplopoda) 370
基于可调谐半导体激光吸收光谱技术泄漏气体检测系统的研究 350
Robot-supported joining of reinforcement textiles with one-sided sewing heads 320
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 3990045
求助须知:如何正确求助?哪些是违规求助? 3532108
关于积分的说明 11256334
捐赠科研通 3270943
什么是DOI,文献DOI怎么找? 1805146
邀请新用户注册赠送积分活动 882270
科研通“疑难数据库(出版商)”最低求助积分说明 809228