2.6 Storing Graphs in Lists

This lesson presents the adjacency list as a memory-efficient method for storing graphs, particularly those that are sparse. It explains how to structure these lists for undirected, directed, and weighted graphs by associating each node with a list of its connected neighbors.

Publication Details

Journal
DuEPublico (University of Duisburg-Essen)
Published
2025-10-08
DOI
https://doi.org/10.17185/duepublico/84452
Primary Topic
Graph Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

2.6 Storing Graphs in Lists

DuEPublico (University of Duisburg-Essen)
Graph Theory and Algorithms
article

2.6 Storing Graphs in Lists

article en

Abstract

This lesson presents the adjacency list as a memory-efficient method for storing graphs, particularly those that are sparse. It explains how to structure these lists for undirected, directed, and weighted graphs by associating each node with a list of its connected neighbors.

DuEPublico (University of Duisburg-Essen)
Openalex Percentile: Top 43%
Graph Theory and Algorithms
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

2.6 Storing Graphs in Lists · DuEPublico (University of Duisburg-Essen) (2025) | TGRS Research Map | TGRS