One of the most intuitive ways of implementing graphs is using adjacency lists. Basically, for each node, we can access a list (or set or other container or iterable) of its neighbors.
- Chapter 2: The Basics
- from Python Algorithms: Mastering Basic Algorithms in the Python Language, Second Edition
- Publisher: Apress
- Released: September 2015
adjacency list: given a node, give a list of neighbors.
Share this highlighthttp://www.safaribooksonline.com/a/python-algorithms-mastering/8197597/