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.

Preview

Category

Published in:
Module 2: Working with Graphs
(08.10.2025)
Date Issued:
08.10.2025
DOI:
10.17185/duepublico/84452
Language:
English
Type of Resource:
Text
Subject categories of the Deutsche Nationalbibliografie:
330 Economics
Destatis subject classification:
290 Wirtschaftswissenschaften
Hosting institution:
Faculty of Social Sciences, Institut für Sozioökonomie (IfSO)

Cite

Citation style:
Could not load citation form.

Rights

Use and reproduction:
This work may be used under a
CC BY 4.0 LogoCreative Commons Attribution 4.0 License (CC BY 4.0)
.