Papers › Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks

Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networks

3 Sep 2019arXiv:1909.01315archive 2025-07-28

Minjie Wang, Da Zheng, Zihao Ye, Quan Gan, Mufei Li, Xiang Song, Jinjing Zhou, Chao Ma, Lingfan Yu, Yu Gai, Tianjun Xiao, Tong He, George Karypis, Jinyang Li, Zheng Zhang

Advancing research in the emerging field of deep graph learning requires new tools to support tensor computation over graphs. In this paper, we present the design principles and implementation of Deep Graph Library (DGL). DGL distills the computational patterns of GNNs into a few generalized sparse tensor operations suitable for extensive parallelization. By advocating graph as the central programming abstraction, DGL can perform optimizations transparently. By cautiously adopting a framework-neutral design, DGL allows users to easily port and leverage the existing components across multiple deep learning frameworks. Our evaluation shows that DGL significantly outperforms other popular GNN-oriented frameworks in both speed and memory consumption over a variety of benchmarks and has little overhead for small scale workloads.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 39 code samples harvested from 3 repositories linked to this paper: 11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 28 unverified. Where Syntology's instrument failed: 2 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 4 samples from 1 repository, 3 ran (1 with no instrument failure; 2 where Syntology's instrument failed); community (archive-listed): 35 samples from 2 repositories, 8 ran (8 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

No sample is linked to this paper from 2 of its repositories that Syntology harvested for other papers:

Levels written on 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed. 3 of the 11 samples that ran have no recorded date.

dglai/dgl-0.5-benchmark officialmentioned in papermentioned on GitHubpytorchSyntology: 4 samples, 3 ran (2 instrument-failed) · 1 unverified report
OweysMomenzada/Graph-Neural-Networks-for-effecient-Recommender-Systems mentioned on GitHubpytorchSyntology: not harvested report
classicsong/dgl mentioned on GitHubpytorchApache-2.0Syntology: 16 samples, 3 ran (0 instrument-failed) · 13 unverified report
dmlc/dgl mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to node2vec: Scalable Feature Learning for Networks (arXiv:1607.00653; that paper's own run record: 15 ran (of which 2 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 0 violated, 10 with no contract checked; 3 where Syntology's instrument failed) · 10 unverified), Interaction Networks for Learning about Objects, Relations and Physics (arXiv:1612.00222; that paper's own run record: 6 ran (of which 6 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 6 samples that ran constructed an object rather than computing a result), Junction Tree Variational Autoencoder for Molecular Graph Generation (arXiv:1802.04364; that paper's own run record: 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result) and 3 more (every one in this page's JSON twin); nothing checks that they implement this paper's method. report
liketheflower/jimmy_dgl mentioned on GitHubpytorchApache-2.0Syntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Benchmarking Graph Neural Networks (arXiv:2003.00982; that paper's own run record: 10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 13 unverified); nothing checks that they implement this paper's method. report
mengyangniu/dgl mentioned on GitHubpytorchApache-2.0Syntology: 19 samples, 5 ran (0 instrument-failed) · 14 unverified report
mengyangniu/dgl mentioned on GitHubpytorchSyntology: 19 samples, 5 ran (0 instrument-failed) · 14 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

39 samples harvested: 11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 28 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · honoured contract
2ran · our draft was wrong
8ran
28unverified

Licence: 4 of the 39 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 3 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

dglai/dgl-0.5-benchmark official repository 4 samples, 3 ran (2 instrument-failed) · 1 unverified
test in 377 papers end_to_end/full_graph/node_classification/main_dgl_arxiv_gat.py ran · our draft was wrong no licence file found · pointer only · 46f5fd24720486a6 · report fixture: signature model:callable/0/?, g:NoneType/0/?, feats:Tensor/2/float, y_true:Tensor/2/int, split_idx:dict/0/?, evaluator:SimpleEvaluator/0/? · returned tuple · level recorded, date not recorded
train in 522 papers end_to_end/full_graph/node_classification/main_dgl_arxiv_gat.py ran · our draft was wrong no licence file found · pointer only · dca95faa102e051a · report fixture: signature model:callable/0/?, g:MinimalGraph/0/?, feats:Tensor/2/float, y_true:Tensor/2/int, train_idx:Tensor/1/int, optimizer:Adam/0/? · returned float · level recorded, date not recorded
train in 522 papers end_to_end/full_graph/graph_classification/main_dgl_enzymes_gcn.py ran · honoured contract no licence file found · pointer only · 44fd758f71d50278 · report fixture: signature model:callable/0/?, device:str/0/str, train_loader:list/1/tuple, optimizer:Adam/0/? · returned float · level recorded, date not recorded
test in 377 papers end_to_end/full_graph/graph_classification/main_dgl_enzymes_gcn.py unverified no licence file found · pointer only · 8d54f057e38fcfbe · report
classicsong/dgl community (archive-listed) 16 samples, 3 ran (0 instrument-failed) · 13 unverified
is_all python/dgl/base.py ran Apache-2.0 (permissive) · 48c452849a73cec5 · report fixture: signature arg:str/0/str · returned bool · level recorded 2026-09-24
make_canonical_etypes python/dgl/heterograph.py ran Apache-2.0 (permissive) · 3d5e4058d7d4c01b · report fixture: signature etypes:list/1/str, ntypes:list/1/str, metagraph:GraphIndex/0/? · returned list · level recorded 2026-09-24
pad_tuple python/dgl/heterograph.py ran Apache-2.0 (permissive) · 3501cbd35b6cf72b · report fixture: signature tup:tuple/1/int, length:int/0/int, pad_val:int/0/int · returned tuple · level recorded 2026-09-24
bipartite python/dgl/convert.py unverified Apache-2.0 (permissive) · 4ddff72fde2480de · report
create_heterograph_from_relations python/dgl/heterograph_index.py unverified Apache-2.0 (permissive) · 38b753df9f728b41 · report
create_unitgraph_from_coo python/dgl/heterograph_index.py unverified Apache-2.0 (permissive) · b08137224326f1df · report
create_unitgraph_from_csr python/dgl/heterograph_index.py unverified Apache-2.0 (permissive) · 240441566b3cb725 · report
frame_like python/dgl/frame.py unverified Apache-2.0 (permissive) · 9a5248c1310fee53 · report
from_coo python/dgl/graph_index.py unverified Apache-2.0 (permissive) · 9251c8049725779c · report
from_csr python/dgl/graph_index.py unverified Apache-2.0 (permissive) · aa41af8d28e61993 · report
from_shared_mem_csr_matrix python/dgl/graph_index.py unverified Apache-2.0 (permissive) · d0f5f02c5770af23 · report
graph in 6 papers python/dgl/convert.py unverified Apache-2.0 (permissive) · 8531b4232412ff4e · report
hetero_from_relations python/dgl/convert.py unverified Apache-2.0 (permissive) · 6de90aafeb665dd4 · report
infer_ntype_from_dict python/dgl/heterograph.py unverified Apache-2.0 (permissive) · d008106df6cdf03c · report
infer_scheme python/dgl/frame.py unverified Apache-2.0 (permissive) · 41db54384fdd01d6 · report
zero_initializer python/dgl/init.py unverified Apache-2.0 (permissive) · c7a98eaf8183d806 · report
mengyangniu/dgl community (archive-listed) 19 samples, 5 ran (0 instrument-failed) · 14 unverified
dgl_warning_format python/dgl/base.py ran Apache-2.0 (permissive) · d15a4a786f69edc6 · report fixture: signature message:str/0/str, category:callable/0/?, filename:str/0/str, lineno:int/0/int, line:str/0/str · returned str · level recorded 2026-09-24
from_csr python/dgl/graph_index.py ran Apache-2.0 (permissive) · 61a050f11d9e1f7e · report fixture: returned GraphIndex · level recorded 2026-09-24
is_internal_column python/dgl/base.py ran Apache-2.0 (permissive) · 791b6657e97a0d13 · report fixture: signature name:str/0/str · returned bool · level recorded 2026-09-24
is_unibipartite python/dgl/heterograph.py ran Apache-2.0 (permissive) · 0fccc3114c12388a · report fixture: signature graph:GraphIndex/0/? · returned bool · level recorded 2026-09-24
make_canonical_etypes python/dgl/heterograph.py ran Apache-2.0 (permissive) · 0495daf585ec447b · report fixture: signature etypes:list/1/str, ntypes:list/1/str, metagraph:GraphIndex/0/? · returned list · level recorded 2026-09-24
convert_to_strmap python/dgl/container.py unverified Apache-2.0 (permissive) · 016ef3147f301232 · report
create_heterograph_from_relations python/dgl/heterograph_index.py unverified Apache-2.0 (permissive) · 0e0d8b04e0a30007 · report
create_unitgraph_from_coo python/dgl/heterograph_index.py unverified Apache-2.0 (permissive) · 08f15e0bcf1f7400 · report
create_unitgraph_from_csr python/dgl/heterograph_index.py unverified Apache-2.0 (permissive) · 9da4a8bee5336752 · report
find_src_dst_ntypes python/dgl/heterograph.py unverified Apache-2.0 (permissive) · 10d68b4b6fa07f82 · report
from_coo python/dgl/graph_index.py unverified Apache-2.0 (permissive) · 4ae9983fc353b1f9 · report
from_shared_mem_graph_index python/dgl/graph_index.py unverified Apache-2.0 (permissive) · e8e462381451afcd · report
graph in 6 papers python/dgl/convert.py unverified Apache-2.0 (permissive) · 0d2f6edf7894499d · report
hetero_from_shared_memory python/dgl/convert.py unverified Apache-2.0 (permissive) · 183b9a930525f173 · report
heterograph python/dgl/convert.py unverified Apache-2.0 (permissive) · 8d819296a523b74d · report
invoke_edge_udf python/dgl/core.py unverified Apache-2.0 (permissive) · c072c366ff17800a · report
invoke_node_udf python/dgl/core.py unverified Apache-2.0 (permissive) · 5aa4d9ca2d36a808 · report
is_builtin python/dgl/core.py unverified Apache-2.0 (permissive) · 79bd37074ea9b315 · report
unbatch in 8 papers python/dgl/batch.py unverified Apache-2.0 (permissive) · 73f17bd169feeaab · report

Tasks

Graph LearningNode Classification

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Node Classification Cora GAT (DGL) Accuracy 83.98% ± 0.52% #34 of 73 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

SPEED

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections