A graph G = (V, E) consists of a set of nodes, V, and edges between them, E. If the edges have a direction, we say the graph is directed.
- Chapter 2: The Basics
- from Python Algorithms: Mastering Basic Algorithms in the Python Language, Second Edition
- Publisher: Apress
- Released: September 2015
So when thinking about graph, ask two questions: 1. what are the nodes? 2. what are the edges?
Share this highlighthttp://www.safaribooksonline.com/a/python-algorithms-mastering/8197576/