2.6 Storing Graphs in Lists
Year: 2025
Type: article
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.
Authors: Weber, Jan, Löffler-Patterson, Caspar
Language: English
Topic: Graph Theory and Algorithms
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7103138362
FWCI:
Cites:
Cited by:
Related to: